DistanceRegular.org
$\text{Johnson graph }J(10,5)$
Number of vertices:
$252$
Diameter:
$5$
Intersection array:
$\{25,16,9,4,1;1,4,9,16,25\}$
Spectrum:
$25^1 15^9 7^{35} 1^{75} (-3)^{90} (-5)^{42}$
Automorphism group:
$S_{10} \times \mathbb{Z}_2$
Distance-transitive:
$\text{Yes}$
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}$
$\text{Andries Brouwer}$
$\text{Wikipedia}$
$\text{Wolfram}$
Back to:
A-Z index
•
Graphs with more than 200 vertices
•
Graphs with diameter 5
•
Johnson Graphs
Last updated: 22 October 2018