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