DistanceRegular.org
Hamming graph $H(3,6)$
Number of vertices:
$216$
Diameter:
$3$
Intersection array:
$\{15,10,5;1,2,3\}$
Spectrum:
$15^1 9^{15} 3^{75} (-3)^{125}$
Automorphism group:
$S_6\text{Wr}S_3$
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 3
•
Hamming Graphs
Last updated: 28 February 2024