DistanceRegular.org
Hamming graph $H(5,4)$
Number of vertices:
$1024$
Diameter:
$5$
Intersection array:
$\{15,12,9,6,3;1,2,3,4,5\}$
Spectrum:
$15^1 11^{15} 7^{90} 3^{270} (-1)^{405} (-5)^{243}$
Automorphism group:
$S_4\text{Wr}S_5$
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 more than 200 vertices
•
Graphs with diameter 5
•
Hamming Graphs
Last updated: 30 January 2017