1 Answers
The Sylvester graph is the unique distance-regular graphwith intersection array { 5 , 4 , 2 ; 1 , 1 , 4 } {\displaystyle \{5,4,2;1,1,4\}}.It is a subgraph of the Hoffman–Singleton graph.
5 views
Answered