The Sylvester graph is the unique distance-regular graph with intersection array { 5 , 4 , 2 ; 1 , 1 , 4 } {\displaystyle \{5,4,2;1,1,4\}} . It is a subgraph of the Hoffman–Singleton graph.
Related Image Collections
Add Image
We don't have any YouTube videos related to Sylvester graph yet.
You can add one yourself here.
We don't have any PDF documents related to Sylvester graph yet.
You can add one yourself here.
We don't have any Books related to Sylvester graph yet.
You can add one yourself here.
We don't have any archived web articles related to Sylvester graph yet.
External links
References
Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-regular graphs, Springer-Verlag, Theorem 13.1.2 ↩