Design spectra for 6-regular graphs with 12 vertices
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909063081623552 |
|---|---|
| author | Forbes, Anthony D. Rutherford, Carrie G. |
| author_facet | Forbes, Anthony D. Rutherford, Carrie G. |
| contents | The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for 7788 6-regular graphs with 12 vertices. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_02846 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Design spectra for 6-regular graphs with 12 vertices Forbes, Anthony D. Rutherford, Carrie G. Combinatorics 05C51 The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for 7788 6-regular graphs with 12 vertices. |
| title | Design spectra for 6-regular graphs with 12 vertices |
| topic | Combinatorics 05C51 |
| url | https://arxiv.org/abs/2401.02846 |