Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
Johnson graph
J
(
26
,
2
)
The complement of this graph is the
Kneser graph
K
(
26
,
2
)
.
Number of vertices:
325
Diameter:
2
Intersection array:
{
48
,
23
;
1
,
4
}
Spectrum:
48
1
22
25
(
−
2
)
299
Automorphism group:
S
26
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 301-500 vertices
•
Graphs with diameter 2
•
Johnson Graphs
Last updated: 24 July 2024