DistanceRegular.org
Hamming graph $H(3,11)$
Number of vertices:
$1331$
Diameter:
$3$
Intersection array:
$\{30,20,10;1,2,3\}$
Spectrum:
$30^1 19^{30} 8^{300} (-3)^{1000}$
Automorphism group:
$S_{11}\text{Wr}S_3$
Distance-transitive:
Yes
Primitive
Downloads
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 more than 1000 vertices
•
Graphs with diameter 3
•
Hamming Graphs
Last updated: 6 May 2024