$\text{Petersen graph} \cong K(5,2) \cong O_3$
| Number of vertices: | $10$ |
| Diameter: | $2$ |
| Intersection array: | $\{3,2; 1,1\}$ |
| Spectrum: | $3^1 1^5 (-2)^4$ |
| Automorphism group: | $S_5$ |
| Distance-transitive: | $\text{Yes}$ |
| Primitive |
$\text{Downloads}$
- $\text{Adjacency matrix}$
- $\text{Adjacency matrix in GAP format}$
- $\text{Adjacency matrix in CSV format}$
- $\text{Graph in GRAPE format}$
$\text{Links}$
- $\text{Andries Brouwer: Petersen graph}$
- $\text{Wikipedia: Petersen graph}$
- $\text{Wolfram: Petersen graph}$
- $\text{Andries Brouwer: Kneser graph}$
- $\text{Wikipedia: Kneser graph}$
- $\text{Wolfram: Kneser graph}$
- $\text{Andries Brouwer: Odd graph}$
- $\text{Wikipedia: Odd graph}$
- $\text{Wolfram: Odd graph}$
Back to: A-Z index • Graphs with up to 50 vertices • Graphs with diameter 2 • Graphs with valency 3 • Kneser graphs • Odd graphs
Last updated: 25 October 2016