Design spectra for 6-regular graphs with 12 vertices

2024/01/05 by Anthony D. Forbes, Forbes, Anthony D., Carrie Rutherford +1 · 1 citation
Neuroscience · Engineering · #Nuclear Receptors and Signaling #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2401.02846

Abstract

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.

Cited by

• The design spectrum of the Shrikhande graph

Related

• The design spectrum of the Shrikhande graph
• Designs for graphs with six vertices and ten edges -- II
• Theta Graph Designs
• Graphical Designs find Combinatorial Structures
• Spectra of (H₁,H₂)-merged subdivision graph of a graph