The Sylvester graph is the unique
distance-regular graph
with intersection array
.
It is a subgraph of the
Hoffman–Singleton graph
In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7- regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1). It was constructed by Alan Hoffman an ...
.
References
{{Reflist
External links
A.E. Brouwer's website: the Sylvester graph
Individual graphs
Regular graphs