Q_8

(2, 2, 2, 2, 2, 2, 2, 2)-grid graph | (8, 104)-bipartite (0, 2)-graph | (8, 2)-Hamming graph | octeract graph | regular hexadecazetton graph | regular hexdeca-8-tope graph

vertex count | 256 edge count | 1024 connected component count | 1

antipodal | arc-transitive | bicolorable | biconnected | bipartite | bridgeless | Cayley graphs | class 1 | connected | cyclic | distance-regular | distance-transitive | edge-transitive | Eulerian | graceful | grid | Hamilton-decomposable | Hamiltonian | Hamilton-laceable | Hamming | H-star connected | hypercube | incidence | integral | LCF | local | median | nonempty | nonplanar | octic | perfect | perfect matching | regular | simple | symmetric | traceable | triangle-free | uniquely colorable | unit-distance | vertex-transitive | weakly perfect | weakly regular | zero-two

vertex degrees | 8 (256 vertices)

radius | 8 diameter | 8 girth | 4 vertex connectivity | 8 edge connectivity | 8

(x - 8) (x - 6)^8 (x - 4)^28 (x - 2)^56 x^70 (x + 2)^56 (x + 4)^28 (x + 6)^8 (x + 8)

chromatic number | 2 edge chromatic number | 8

(-8)^1 (-6)^8 (-4)^28 (-2)^56 0^70 2^56 4^28 6^8 8^1

Kirchhoff index | 9639 stability index | 8.983×10^87 Wiener index | 131072