Jump to content

Sylvester graph

From Wikipedia, the free encyclopedia
Sylvester graph
Vertices36
Edges90
Radius3
Diameter3
Girth5
Automorphisms1440
Chromatic number4
Chromatic index5
PropertiesDistance 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.

References

[edit]
  1. ^ Brouwer, A. E.; Cohen, A. M.; Neumaier, A. (1989), Distance-regular graphs, Springer-Verlag, Theorem 13.1.2
[edit]