Sylvester graph

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Sylvester graph" – news · newspapers · books · scholar · JSTOR (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  { 5 , 4 , 2 ; 1 , 1 , 4 } {\displaystyle \\{5,4,2;1,1,4\\}} .[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

## External links

[edit]

* A.E. Brouwer's website: the Sylvester graph

This graph theory-related article is a stub. You can help Wikipedia by expanding it.

|

* v
* t
* e

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template