Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
Kneser graph
K
(
31
,
2
)
This graph is the complement of the
Johnson graph
J
(
31
,
2
)
.
Number of vertices:
465
Diameter:
2
Intersection array:
{
406
,
54
;
1
,
378
}
Spectrum:
406
1
1
434
(
−
28
)
30
Automorphism group:
S
31
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
•
Kneser Graphs
Last updated: 24 July 2024