Database of small proper divisible design graphs

Below are tables with small proper divisible design graphs. These results were obtained in [46].

The columns are:

• number of divisible design graphs with specified parameters and spectrum (graphs with the same parameters can have different spectra)
• v – number of vertices
• k – valency
• λ₁ – number of common neighbors for two distinct vertices from the same class
• λ₂ – number of common neighbors for two distinct vertices from different classes
• m – number of classes
• n – size of the class
• spectrum – non-principal eigenvalues and their multiplicities
• graphs – link to the table with all graphs with specified parameters; comments, adjacency matrices, quotient matrices and WL-closures are presented there
• matrices – link to view adjacency matrices (in raw, GAP, Magma or SageMath format)
• download – link to download adjacency matrices (in raw, GAP, Magma or SageMath format)
• quotient matrices – link to view or download quotient matrices of presented graphs
• WL-closure – link to view or download WL-closures of presented graphs

8-39 vertices

Download all adjacency matrices: raw, gap, magma, sage
Download all WL-closures: download

More computational results by V. V. Kabanov are available here: 40+ vertices