Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
Johnson graph
J
(
43
,
2
)
The complement of this graph is the
Kneser graph
K
(
43
,
2
)
.
Number of vertices:
903
Diameter:
2
Intersection array:
{
82
,
40
;
1
,
4
}
Spectrum:
82
1
39
42
(
−
2
)
860
Automorphism group:
S
43
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 501-1000 vertices
•
Graphs with diameter 2
•
Johnson Graphs
Last updated: 24 July 2024