$\text{Desargues graph} \cong D(O_3)$
| Number of vertices: | $20$ |
| Diameter: | $5$ |
| Intersection array: | $\{3,2,2,1,1; 1,1,2,2,3\}$ |
| Spectrum: | $3^1 2^4 1^5 (-1)^5 (-2)^4 (-3)^1$ |
| Automorphism group: | $S_5 \times \mathbb{Z}_2$ |
| Distance-transitive: | $\text{Yes}$ |
| Bipartite, Antipodal |
$\text{Downloads}$
- $\text{Adjacency matrix}$
- $\text{Adjacency matrix in GAP format}$
- $\text{Adjacency matrix in CSV format}$
- $\text{Graph in GRAPE format}$
$\text{Links}$
Back to: A-Z index •
Graphs with up to 50 vertices •
Graphs with diameter 5 •
Graphs with valency 3 •
Bipartite doubles
Last updated: 19 January 2017