DistanceRegular.org
Hamming graph $H(5,3)$
Number of vertices:
$243$
Diameter:
$5$
Intersection array:
$\{10,8,6,4,2;1,2,3,4,5\}$
Spectrum:
$10^1 7^{10} 4^{40} 1^{80} (-2)^{80} (-5)^{32}$
Automorphism group:
$S_3\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 201-300 vertices
•
Graphs with diameter 5
•
Graphs with valency 10
•
Hamming Graphs
Last updated: 28 February 2024