DistanceRegular.org
Hamming graph $H(6,3)$
Number of vertices:
$729$
Diameter:
$6$
Intersection array:
$\{12,10,8,6,4,2;1,2,3,4,5,6\}$
Spectrum:
$12^1 9^{12} 6^{60} 3^{160} 0^{240} (-3)^{192} (-6)^{64}$
Automorphism group:
$S_3\text{Wr}S_6$
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 501-1000 vertices
•
Graphs with diameter 6
•
Graphs with valency 12
•
Hamming Graphs
Last updated: 8 May 2024