Browse > Article
http://dx.doi.org/10.7858/eamj.2014.021

CIRCULANT DECOMPOSITIONS OF CERTAIN MULTIPARTITE GRAPHS INTO GREGARIOUS CYCLES OF A GIVEN LENGTH  

Cho, Jung Rae (Department of Mathematics Pusan National University)
Publication Information
East Asian mathematical journal / v.30, no.3, 2014 , pp. 311-319 More about this Journal
Abstract
It is shown that, for an even positive integer m with $m{\geq}4$ and arbitrary positive integer k and t, the complete multipartite graph $K_{km+1(2t)}$ can be decomposed into edge-disjoint gregarious m-cycles in such a way that the decomposition is circulant.
Keywords
multipartite graphs; gregarious cycles; circulant decomposition;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 D. Sotteau, Decomposition of $K(m,n)(K^*_{m,n}$ into cycles (circuits) of length 2k. J. Combin. Theory Ser B. 30(1981), 75-81.   DOI
2 M. Sajna, On decompositing $K_n-I$ into cycles of a fixed odd length. Discrete Math. 244(2002), 435-444.   DOI   ScienceOn
3 B. R. Smith, Some gregarious cycle decompositions of complete equipartite graphs. Electron. J. Combin. 16(2009), no. 1, Research Paper 135, p17.
4 B. Alspach and H. Gavlas, Cycle decompositions of $K_n$ and $K_n-I$. J. Combin. Theory Ser. B 81(2001), 77-99.   DOI   ScienceOn
5 E. Billington and D. G. Hoffman, Decomposition of complete tripartite graphs into gre-garious 4-cycles. Discrete Math. 261(2003), 87-111.   DOI   ScienceOn
6 E. Billington, D. G. Hoffman and C. A. Rodger, Resolvable gregarious cycle decompositions of complete equipartite graphs. Discrete Math. 308 (2008), no. 13, 2844-2853.   DOI   ScienceOn
7 N. J. Cavenagh and E. J. Billington, Decompositions of complete multipartite graphs into cycles of even length. Graphs and Combinatorics 16(2000), 49-65.   DOI
8 J. R. Cho, A note on decomposition of complete equipartite graphs into gregarious 6-cycles. Bulletin of the Korean Mathematical Society 44(2007) 709-719.   과학기술학회마을   DOI   ScienceOn
9 J. R. Cho and R. J. Gould, Decompositions of complete multipartite graphs into gregar-ious 6-cycles using complete differences. Journal of the Korean Mathematical Society 45(2008) 1623-1634.   과학기술학회마을   DOI   ScienceOn
10 J. R. Cho, J. M. Park, and Y. Sano, Edge-disjoint decompositions of complete multipar-tite graphs into gregarious long cycles. Computational Geometry and Graphs. Lecture Notes in Computer Science 8296(2012) 57-63.
11 E. K. Kim, Y. M. Cho, and J. R. Cho, A difference set method for circulant decompo-sitions of complete partite graphs into gregarious 4-cycles. East Asian Mathematical Journal 26(2010) 655-670.   과학기술학회마을
12 J. Liu, A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs. J. Combin. Designs 9(2000), 42-49.
13 M. Sajna, Cycle decompositions III: complete graphs and fixed length cycles. J. Combin. Designs 10(2002), 27-78.   DOI   ScienceOn
14 E. J. Billington, B. R. Smith, and D. G. Hoffman, Equipartite gregarious 6- and 8-cycle systems. Discrete Mathematics 307(2007) 1659-1667.   DOI   ScienceOn