JOURNAL ARTICLE
Cycle decompositions of complete multigraphs
Year: 2009 Journal: Journal of Combinatorial Designs Vol: 18 (2)Pages: 85-93 Publisher: Wiley
Abstract
Abstract In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph λ K n into cycles of length λ, and the λ‐fold complete symmetric digraph λ K into directed cycles of length λ. As a corollary to these results we obtain necessary and sufficient conditions for decomposing λ K n (respectively, λ K ) into cycles (respectively, directed cycles) of prime length. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 85–93, 2010
Keywords:
Multigraph Corollary Digraph Mathematics Combinatorics Prime (order theory) Discrete mathematics Graph
Metrics
14
Cited By
1.59
FWCI (Field Weighted Citation Impact)
9
Refs
0.87
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
graph theory and CDMA systems
Physical Sciences → Engineering → Electrical and Electronic Engineering
Coding theory and cryptography
Physical Sciences → Computer Science → Artificial Intelligence
Finite Group Theory Research
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Related Documents
JOURNAL ARTICLE
Cycle decompositions of complete multigraphs
Darryn BryantDaniel HorsleyBarbara MaenhautBenjamin R. Smith
Journal: Journal of Combinatorial Designs Year: 2010 Vol: 19 (1)Pages: 42-69
JOURNAL ARTICLE
Symmetric Hamilton cycle decompositions of complete multigraphs
Journal: Discussiones Mathematicae Graph Theory Year: 2013 Vol: 33 (4)Pages: 695-695
BOOK-CHAPTER
Path and Cycle Decompositions of Complete Multigraphs
Katherlne HeinrichGillian Marie Nonay
North-Holland mathematics studies Year: 1985 Pages: 275-286
DISSERTATION
Cycle and closed trail decompositions of complete equipartite graphs and complete multigraphs
University: uO Research (University of Ottawa) Year: 2009