DistanceRegular.org
Hamming graph $H(3,7)$
Number of vertices:
$343$
Diameter:
$3$
Intersection array:
$\{18,12,6;1,2,3\}$
Spectrum:
$18^1 11^{18} 4^{108} (-3)^{216}$
Automorphism group:
$S_7\text{Wr}S_3$
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 301-500 vertices
•
Graphs with diameter 3
•
Hamming Graphs
Last updated: 28 February 2024