Abstract
<p>A <span class="math"><em>G</em></span>-decomposition of the complete graph <span class="math"><em>K</em><sub><em>n</em></sub></span> is a family of pairwise edge disjoint subgraphs of <span class="math"><em>K</em><sub><em>n</em></sub></span>, all isomorphic to <span class="math"><em>G</em></span>, such that every edge of <span class="math"><em>K</em><sub><em>n</em></sub></span> belongs to exactly one copy of <span class="math"><em>G</em></span>. Using standard decomposition techniques based on <span class="math"><em>ρ</em></span>-labelings, introduced by Rosa in 1967, and their modifications we show that each of the ten non-isomorphic connected unicyclic graphs with eight edges containing the pentagon decomposes the complete graph <span class="math"><em>K</em><sub><em>n</em></sub></span> whenever the necessary conditions are satisfied.</p>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
