Graphical Designs on the Hoffman-Singleton Graph


Graph Info
Vertices 50
Edges 175
Regularity 7
Eigenspaces 3


Spectrum from low to high frequency:

`0, -1.42859^{21}, -0.7143^{28}`

Hoffman Singleton Graph


Design Info
`k`-graphical design
`k=2`
Efficacy
`10/22`
Optimal yes
Maximal yes
Extremal yes
1-Neighborhood is the graph yes



Get the code or see Wikipedia for more about the Hoffman-Singleton graph.