DistanceRegular.org
Hamming graph $H(4,4)$
Number of vertices:
$256$
Diameter:
$4$
Intersection array:
$\{12,9,6,3;1,2,3,4\}$
Spectrum:
$12^1 8^{12} 4^{54} 0^{108} (-4)^{81}$
Automorphism group:
$S_4\text{Wr}S_4$
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)$
Back to:
A-Z index
•
Graphs with 201-300 vertices
•
Graphs with diameter 4
•
Graphs with valency 12
•
Hamming Graphs
Last updated: 28 February 2024