DistanceRegular.org
Hamming graph $H(4,5)$
Number of vertices:
$625$
Diameter:
$4$
Intersection array:
$\{16,12,8,4,2;1,2,3,4\}$
Spectrum:
$16^1 11^{16} 6^{96} 1^{256} (-4)^{256}$
Automorphism group:
$S_5\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 501-1000 vertices
•
Graphs with diameter 4
•
Hamming Graphs
Last updated: 29 February 2024