DistanceRegular.org
Hamming graph $H(2,33)$
Number of vertices:
$1089$
Diameter:
$2$
Intersection array:
$\{64,32;1,2\}$
Spectrum:
$64^1 31^{64} (-2)^{1024}$
Automorphism group:
$S_{33}\text{Wr}\mathbb{Z}_2$
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)$
Wikipedia: Rook's graph $H(2,q)$
Wolfram: Rook's graph $H(2,q)$
Back to:
A-Z index
•
Graphs with more than 1000 vertices
•
Graphs with diameter 2
•
Hamming Graphs
Last updated: 8 May 2024