Sylvester graph
| Sylvester graph | |
|---|---|
 | |
| Vertices | 36 |
| Edges | 90 |
| Radius | 3 |
| Diameter | 3 |
| Girth | 5 |
| Automorphisms | 1440 |
| Chromatic number | 4 |
| Chromatic index | 5 |
| Properties |
Distance regular Hamiltonian |
The Sylvester graph is the unique distance-regular graph
with intersection array 
.[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
This article is issued from Wikipedia - version of the Monday, April 11, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.