DistanceRegular.org
Johnson graph $J(7,2)$
The complement of this graph is the
Kneser graph $\mathrm{K}(7,2)$
.
Number of vertices:
$21$
Diameter:
$2$
Intersection array:
$\{10,4;1,4\}$
Spectrum:
$10^1 3^6 (-2)^{14}$
Automorphism group:
$\mathrm{S}_7$
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
•
Graphs with valency 10
•
Johnson Graphs
Last updated: 23 July 2024