DistanceRegular.org
Hamming graph $H(3,4)$
Number of vertices:
$64$
Diameter:
$3$
Intersection array:
$\{9,6,3;1,2,3\}$
Spectrum:
$9^1 5^9 1^{27} (-3)^{27}$
Automorphism group:
$S_4\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 51-100 vertices
•
Graphs with diameter 3
•
Graphs with valency 9
•
Hamming Graphs
Last updated: 30 January 2017