DistanceRegular.org
Hamming graph $H(2,10)$
Number of vertices:
$100$
Diameter:
$2$
Intersection array:
$\{18,9;1,2\}$
Spectrum:
$18^1 8^{18} (-2)^{81}$
Automorphism group:
$S_{10}\text{Wr}\mathbb{Z}_2$
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)$
Wikipedia: Rook's graph $H(2,q)$
Wolfram: Rook's graph $H(2,q)$
Back to:
A-Z index
•
Graphs with 51-100 vertices
•
Graphs with diameter 2
•
Hamming Graphs
Last updated: 5 January 2018