DistanceRegular.org
5-cube $Q_5 \cong H(5,2)$
Number of vertices:
$32$
Diameter:
$5$
Intersection array:
$\{5,4,3,2,1; 1,2,3,4,5\}$
Spectrum:
$5^1 3^5 1^{10} (-1)^{10} (-3)^5 (-5)^1$
Automorphism group:
$\mathbb{Z}_2\text{Wr}S_5$
Distance-transitive:
Yes
Bipartite
,
Antipodal
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: Hypercube graph $H(d,2)$
Wolfram: Hypercube graph $H(d,2)$
Back to:
A-Z index
•
Graphs with up to 50 vertices
•
Graphs with diameter 5
•
Graphs with valency 5
•
Hamming Graphs
Last updated: 4 February 2017