DistanceRegular.org
Hamming graph $H(2,2)$
Number of vertices:
$4$
Diameter:
$2$
Intersection array:
$\{2,1;1,2\}$
Spectrum:
$2^1 0^2 (-2)^1$
Automorphism group:
$S_2\text{Wr}S_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 up to 50 vertices
•
Graphs with diameter 2
•
Graphs with valency 2
•
Hamming Graphs
Last updated: 30 January 2017