Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
Hamming graph
H
(
3
,
3
)
Number of vertices:
27
Diameter:
3
Intersection array:
{
6
,
4
,
2
;
1
,
2
,
3
}
Spectrum:
6
1
3
6
0
12
(
−
3
)
8
Automorphism group:
S
3
Wr
S
3
Distance-transitive:
Yes
Primitive
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
Links
Andries Brouwer: Hamming graph
H
(
d
,
q
)
Wikipedia: Hamming graph
H
(
d
,
q
)
Wolfram: Hamming graph
H
(
d
,
q
)
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 3
•
Graphs with valency 6
•
Hamming Graphs
Last updated: 30 January 2017