The Sylvester graph is the unique distance-regular graph with intersection array .[1] It is a subgraph of the Hoffman–Singleton graph.
References
- ^ Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-regular graphs, Springer-Verlag, Theorem 13.1.2
External links