Abstract
We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 235-250 |
| Number of pages | 16 |
| Journal | Electronic Journal of Graph Theory and Applications |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2019 |
Bibliographical note
Publisher Copyright:© 2019, Indonesian Combinatorics Society.
Keywords
- Graph decomposition
- Rosa type labeling
- α-labeling
- α-labeling
Fingerprint
Dive into the research topics of 'Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS