DistanceRegular.org
Johnson graph $J(10,2)$
The complement of this graph is the
Kneser graph $\mathrm{K}(10,2)$
.
Number of vertices:
$45$
Diameter:
$2$
Intersection array:
$\{16,7;1,4\}$
Spectrum:
$16^1 6^9 (-2)^{35}$
Automorphism group:
$\mathrm{S}_{10}$
Distance-transitive:
Yes
Primitive
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Links
Andries Brouwer
Wikipedia
Wolfram
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 2
•
Johnson Graphs
Last updated: 23 July 2024