| Sylvester graph | |
| Vertices: | 36 |
| Edges: | 90 |
| Automorphisms: | 1440 |
| Radius: | 3 |
| Diameter: | 3 |
| Girth: | 5 |
| Chromatic Number: | 4 |
| Chromatic Index: | 5 |
| Properties: | Distance regular Hamiltonian |
The Sylvester graph is the unique distance-regular graphwith intersection array
\{5,4,2;1,1,4\}
