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

John Fahnenstiel, Dalibor Froncek

Abstract


We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necesary conditions are satisfied.


Keywords


graph decomposition, Rosa type labeling, $\alpha$-labeling, $\sigma^+$-labeling

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2019.7.2.4

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats