This article relies largely or entirely on a
single source. (April 2024) |
Sylvester graph | |
---|---|
Vertices | 36 |
Edges | 90 |
Radius | 3 |
Diameter | 3 |
Girth | 5 |
Automorphisms | 1440 |
Chromatic number | 4 |
Chromatic index | 5 |
Properties |
Distance regular Hamiltonian |
Table of graphs and parameters |
The Sylvester graph is the unique distance-regular graph with intersection array . [1] It is a subgraph of the Hoffman–Singleton graph.