DistanceRegular.org
Hamming graph $H(3,15)$
Number of vertices:
$3375$
Diameter:
$3$
Intersection array:
$\{42,28,14;1,2,3\}$
Spectrum:
$42^1 27^{42} 12^{588} (-3)^{2744}$
Automorphism group:
$S_{15}\text{Wr}S_3$
Distance-transitive:
Yes
Primitive
Downloads
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 1000 vertices
•
Graphs with diameter 3
•
Hamming Graphs
Last updated: 7 May 2024