Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
Kneser graph
K
(
8
,
2
)
≅
N
O
+
6
(
2
)
graph
This graph is the unique
S
R
G
(
28
,
15
,
6
,
10
)
. It is the complement of the
Johnson graph
J
(
8
,
2
)
.
Number of vertices:
28
Diameter:
2
Intersection array:
{
15
,
8
;
1
,
10
}
Spectrum:
15
1
1
20
(
−
5
)
7
Automorphism group:
S
8
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
•
Kneser graphs
•
Nonisotropic orthogonal graphs
Last updated: 13 August 2024