본문 바로가기
KERD
논문KCI 등재

Circulant Decompositions of Certain Multipartite Graphs into Gregarious Cycles of a Given Length

0

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류수학

초록

It is shown that, for an even positive integer $m$ with $m\geq 4$ and arbitrary positive integer $k$ and $t$, the complete multipartitegraph $K_{km+1(2t)}$ can be decomposed into edge-disjoint gregarious $m$-cycles in such a way that the decomposition is circulant.

Abstract

It is shown that, for an even positive integer $m$ with $m\geq 4$ and arbitrary positive integer $k$ and $t$, the complete multipartitegraph $K_{km+1(2t)}$ can be decomposed into edge-disjoint gregarious $m$-cycles in such a way that the decomposition is circulant.

참고문헌 (14)

  1. B. Alspach, "Cycle decompositions of Kn and KnI", J. Combin. Theory Ser. B, 81, pp.77~99 (2001)
  2. E. Billington, "Decomposition of complete tripartite graphs into gregarious 4-cycles", Discrete Math, 261, pp.87~111 (2003)
  3. E. Billington, "Resolvable gregarious cycle decompositions of complete equipartite graphs", Discrete Math, 308(13), pp.2844~2853 (2008)
  4. N. J. Cavenagh, "Decompositions of complete multipartite graphs into cycles of even length", Graphs and Combinatorics, 16, pp.49~65 (2000)
  5. E. J. Billington, "Equipartite gregarious 6- and 8-cycle systems", Discrete Mathematics, 307, pp.1659~1667 (2007)
  6. 조정래, "A note on decomposition of complete equipartite graphs into gregarious $6$-cycles", 대한수학회보, 44(4), pp.709~719 (2007), 대한수학회
  7. 조정래, "DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES", 대한수학회지, 45(6), pp.1623~1634 (2008), 대한수학회
  8. J. R. Cho, "Edge-disjoint decompositions of complete multipartite graphs into gregarious long cycles. Computational Geometry and Graphs", Lecture Notes in Computer Science, 8296, pp.57~63 (2012)
  9. 김은경, "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), 영남수학회
  10. J. Liu, "A generalization of the Oberwolfach problem and Ct-factorizations of complete equipartite graphs", J. Combin. Designs, 9, pp.42~49 (2000)
  11. M. Sajna, "Cycle decompositions III: complete graphs and xed length cycles", J. Combin. Designs, 10, pp.27~78 (2002)
  12. M. Sajna, "On decompositing Kn I into cycles of a xed odd length", Discrete Math, 244, pp.435~444 (2002)
  13. B. R. Smith, "Some gregarious cycle decompositions of complete equipartite graphs", Electron. J. Combin, 16(1), pp.17~ (2009)
  14. D. Sotteau, "Decomposition of Km;n (Km;n) into cycles (circuits) of length 2k", J. Com-bin. Theory Ser B, 30, pp.75~81 (1981)

관련 논문AI추천

이 간행물의 다른 논문 (12건)