DistanceRegular.org
Hamming graph $H(2,31)$
Number of vertices:
$961$
Diameter:
$2$
Intersection array:
$\{60,30;1,2\}$
Spectrum:
$60^1 29^{60} (-2)^{900}$
Automorphism group:
$\mathrm{S}_{31}\text{Wr}\mathbb{Z}_2$
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)$
Wikipedia: Rook's graph $H(2,q)$
Wolfram: Rook's graph $H(2,q)$
Back to:
A-Z index
•
Graphs with 501-1000 vertices
•
Graphs with diameter 2
•
Hamming Graphs
•
Rank-3 graphs on 961 vertices
Last updated: 24 May 2024