PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 10, 2026Journal of Algebra Combinatorics Discrete Structures and Applications0 citationsOpen Access

Multidecomposition of complete graphs into cycles and claws

PLPanneerselvam LakshmananIMIlayaraja ManiprakasamMAMuthusamy Appu

Key Points

  • The aim is to establish conditions for decomposing complete graphs into specified cycles and claws.
  • Analyzed complete graphs K_n with n vertices
  • Defined cycles C_6 and claws S_3
  • Derived decomposition conditions based on the number of edges
  • Decomposition exists if 6α + 3β = n(n − 1)/2 with constraints on β for odd and even n.
  • For odd n, β cannot be 1 or 2; for even n, β must be at least ⌈n/4⌉.

Abstract

Let Cn and Sn respectively denote a cycle and star with n edges. Let Kn denote a complete graph on n vertices. In this paper, it is shown that for any non-negative integers α and β and any positive integer n ≥ 6, there exists a decomposition of Kn into α copies of C6 and β copies of S3 if and only if 6α + 3β = n(n − 1) 2 β ≠ 1, 2 when n is odd, and β ≥ ⌈n/4⌉ when n is even.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lakshmanan et al. (2026) studied this question.

synapsesocial.com/papers/6a001ff2c8f74e3340f9b188https://doi.org/10.13069/jacodesmath.v13i2.271
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Decomposition of Complete Graphs into Paths and Stars with Different Number of Edges2024
  2. 2Claw-decomposition of generalized Kneser graph GKGn,3,12025
  3. 3Multi-Decomposition of Complete Graphs into Stars and Bowties of Size 62024 · 1 citations
  4. 4On Decompositions of \(\mathbf{K_{18k}}\) and \(\mathbf{K_{18k+1}}\) into Certain Connected Bicyclic Graphs with Nine Edges2024
  5. 5Star-Forest Decompositions of Complete Graphs2024