Design spectra for 6-regular graphs with 12 vertices
Combinatorics
2024-01-08 v1
Abstract
The design spectrum of a simple graph is the set of positive integers such that there exists an edgewise decomposition of the complete graph into copies of . We compute the design spectra for 7788 6-regular graphs with 12 vertices.
Cite
@article{arxiv.2401.02846,
title = {Design spectra for 6-regular graphs with 12 vertices},
author = {Anthony D. Forbes and Carrie G. Rutherford},
journal= {arXiv preprint arXiv:2401.02846},
year = {2024}
}
Comments
261 pages. The paper without the appendix will be submitted to a journal