DistanceRegular.org
Hamming graph $H(3,10)$
Number of vertices:
$1000$
Diameter:
$3$
Intersection array:
$\{27,18,9;1,2,3\}$
Spectrum:
$27^1 17^{27} 7^{243} (-3)^{729}$
Automorphism group:
$S_{10}\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 501-1000 vertices
•
Graphs with diameter 3
•
Hamming Graphs
Last updated: 7 May 2024