Sylvester graph
From HandWiki
| 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 [math]\displaystyle{ \{5,4,2;1,1,4\} }[/math].[1] It is a subgraph of the Hoffman–Singleton graph.
References
- ↑ Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-regular graphs, Springer-Verlag, Theorem 13.1.2
External links
 |  |
