HYPERCUBE GRAPH

Q_n has 2^n vertices, each an n-bit string. Edges connect strings differing by 1 bit. Gray code traces a Hamiltonian path.

Vertices: 8
Edges: 12
Gray path step:
Drag to rotate | Scroll to zoom | Gray code: each step flips exactly 1 bit