Abstract
A G-design of order n is a decomposition of the complete graph Kn into isomorphic copies of G. We show that if G is a connected bicyclic graph with nine edges containing two triangles, a G-design of order n exists whenever n ≡ 0, 1 (mod 18).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 271-281 |
| Number of pages | 11 |
| Journal | Transactions on Combinatorics |
| Volume | 14 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2025 |
Bibliographical note
Publisher Copyright:© 2025 University of Isfahan
Keywords
- bicyclic graphs
- graph decomposition
- rho-labelings
Fingerprint
Dive into the research topics of 'G-DESIGNS FOR THE CONNECTED TRIANGULAR BICYCLIC GRAPHS WITH NINE EDGES'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS