DistanceRegular.org
Hamming graph $H(2,41)$
Number of vertices:
$1681$
Diameter:
$2$
Intersection array:
$\{80,40;1,2\}$
Spectrum:
$80^1 39^{80} (-2)^{1600}$
Automorphism group:
$\mathrm{S}_{41}\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: 27 May 2024