DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
0
조회
0
다운로드
3
인용
0
참고문헌
키워드
초록
The complete multipartite graph Kn(2t) having n partite sets of size 2t, with n ≥ 6 and t ≥ 1, is shown to have a decomposition into gregarious 6-cycles, that is, the cycles which have at most one vertex from any particular partite set. Complete sets of differences of numbers in Zn are used to produce starter cycles and obtain other cycles by rotating the cycles around the n-gon of the partite sets.
Abstract
The complete multipartite graph Kn(2t) having n partite sets of size 2t, with n ≥ 6 and t ≥ 1, is shown to have a decomposition into gregarious 6-cycles, that is, the cycles which have at most one vertex from any particular partite set. Complete sets of differences of numbers in Zn are used to produce starter cycles and obtain other cycles by rotating the cycles around the n-gon of the partite sets.
참고문헌 (9)
- B. Alspach, "Cycle decompositions of Kn and Kn − I", Journal of Combinatorial Theory Series B, 81(1), pp.77~99 (2001)
- E. Billington, "Decomposition of complete tripartite graphs into gregarious 4-cycles", Discrete Mathematics, 261(1), pp.87~111 (2003)
- E. Billington, "Resolvable gregarious cycle decompositions of complete equipartite graphs, Preprint", ~
- N. J. Cavenagh, "Decomposition of complete multipartite graphs into cycles of even length", Graphs and Combinatorics, 16(1), pp.49~65 (2000)
- J. R. Cho, "Difference sets generating gregarious 4-cycle decomposition of complete multipartite graphs. Preprint", ~
- J. Liu, "A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs", Journal of Combinatorial Designs, 8(1), pp.42~49 (2000)
- M. Sajna, "Cycle decompositions. III. Complete graphs and fixed length cycles", Journal of Combinatorial Designs, 10(1), pp.27~78 (2002)
- M. Sajna, "On decomposing Kn − I into cycles of a fixed odd length", Discrete Mathematics, 244(1), pp.435~444 (2002)
- D. Sotteau, "Decomposition of Km,n(K∗m,n) into cycles (circuits) of length 2k", Journal of Combinatorial Theory Series B, 30(1), pp.75~81 (1981)