Sylvester graph

The Sylvester graph is the unique distance-regular graph with intersection array { 5 , 4 , 2 ; 1 , 1 , 4 } . It is a subgraph of the Hoffman–Singleton graph.