Sylvester graph
| Number of vertices: | $36$ |
| Diameter: | $3$ |
| Intersection array: | $\{5,4,2;1,1,4\}$ |
| Spectrum: | $5^1 2^{16} (-1)^{10} (-3)^9$ |
| Automorphism group: | $\text{Aut}(S_6)$ |
| Distance-transitive: | Yes |
| Primitive |
Downloads
- Adjacency matrix
- Adjacency matrix in GAP format
- Adjacency matrix in CSV format
- Graph in GRAPE format
Links
Back to: A-Z index •
Graphs with up to 50 vertices •
Graphs with diameter 3 •
Graphs with valency 5
Last updated: 4 February 2017