A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let k, m and t be positive integers with m ≥ 4 and even. It is shown that Kkm+1(2t) has a decomposition into gregarious m-cycles. Also, it is shown that Kkm(2t) has a decomposition into gregarious m-cycles if(m−1)2+3 < k. In this article, we make a remark that the decompositions 4mcan be circulant in the sense that it is preserved by the cyclic permutation of the partite sets, and we will exhibit it by examples.
Abstract
Let k, m and t be positive integers with m ≥ 4 and even. It is shown that Kkm+1(2t) has a decomposition into gregarious m-cycles. Also, it is shown that Kkm(2t) has a decomposition into gregarious m-cycles if(m−1)2+3 < k. In this article, we make a remark that the decompositions 4mcan be circulant in the sense that it is preserved by the cyclic permutation of the partite sets, and we will exhibit it by examples.
참고문헌 (19)
- B. Alspach, "Cycle decompositions of Kn and Kn -I", J. Combin. Theory Ser. B, 81, pp.77~99 (2001)
- E. Billington, "Decomposition of complete tripartite graphs into gre-garious 4-cycles", Discrete Math, 261, pp.87~111 (2003)
- E. Billington, "Equipartite and almost-equipartite gregarious 4-cycle decompositions", Discrete Math, 308(5-6), pp.696~714 (2008)
- E. Billington, "Resolvable gregarious cycle decomposi-tions of complete equipartite graphs", Discrete Math, 308(13), pp.2844~2853 (2008)
- N. J. Cavenagh, "Decompositions of complete multipartite graphs into cycles of even length", Graphs and Combinatorics, 16, pp.49~65 (2000)
- G. Chartrand, "Graphs and digraphs", pp.2005, Chapman & Hall
- 조정래, "Circulant Decompositions of Certain Multipartite Graphs into Gregarious Cycles of a Given Length", East Asian Mathematical Journal, 30(3), pp.311~319 (2014), 영남수학회[DOI]
- A difference set method for circular decompositions of complete mutipartite graphs into gregarious 4-cycles. Research note, "J. R. Cho", ~ (2006)
- 조정래, "DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES", 대한수학회지, 45(6), pp.1623~1634 (2008), 대한수학회
- 김은경, "A difference set method for circulant decompositions of complete partite graphs into gregarious 4-cycles", East Asian Mathematical Journal, 26(5), pp.655~670 (2010), 영남수학회
- 김성근, "ON DECOMPOSITIONS OF THE COMPLETE EQUIPARTITE GRAPHS Kkm(2t) INTO GREGARIOUS m-CYCLES", East Asian Mathematical Journal, 29(3), pp.337~347 (2013), 영남수학회[DOI]
- J. Liu, "A generalization of the Oberwolfach problem with uniform tables", J. Combin. Theory Ser. A, 101, pp.20~34 (2003)
- J. Liu, "The equipartite Oberwolfach problem and Ct-factorizations of complete equipartite graphs", J. Combin. Designs, 9, pp.42~49 (2000)
- M. Sajna, "On decomposiing Kn - I into cycles of a fixed odd length", Descrete Math, 244, pp.435~444 (2002)
- M. Sajna, "Cycle decompositions III: complete graphs and fixed length cycles", J. Combin. Designs, 10, pp.27~78 (2002)
- B. R. Smith, "Decomposing complete equipartite graphs into cycles of length 2p", J. Combin. Des, 16(3), pp.244~252 (2008)
- B. R. Smith, "Complete equipartite 3p -cycle systems", Australas. J. Combin, 45, pp.125~138 (2009)
- B. R. Smith, "Decomposing complete equipartite graphs into odd square-length cycles: number of parts even", Discrete Math, 312(10), pp.1611~1622 (2012)
- D. Sotteau, "Decomposition of Km;n (K*m;n) into cycles (circuits) of length 2k", J. Com-bin. Theory Ser B, 30, pp.75~81 (1981)
