$G$-designs for the connected triangular bicyclic graphs with nine edges
A $G$-design of order $n$ is a decomposition of the complete graph $K_n$ 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 \equiv 0,1 \pmod{18}$.
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2024-11-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_28944_0251192f0ac271abed0c719b103dc4d4.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|