Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges

Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges

<p>We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph <span class="math"><em>K</em><sub><em>n</em></sub></span> whenever the necesary conditions are satisfied....

Full description

Bibliographic Details
Main Authors: John Fahnenstiel, Dalibor Froncek
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
graph decomposition, rosa type labeling, $\alpha$-labeling, $\sigma^+$-labeling
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/714

Internet

https://www.ejgta.org/index.php/ejgta/article/view/714

Similar Items