A **hypercube graph**, often denoted as \( Q_n \), is a graph that represents the relationships between the vertices of an \( n \)-dimensional hypercube. The vertices of the hypercube correspond to the binary strings of length \( n \), and there is an edge between two vertices if the corresponding binary strings differ in exactly one bit position.

Articles by others on the same topic (1)

Hypercube graph by Codex 0 Created 2026-09-28 Updated 2026-10-14
The -dimensional hypercube graph has vertex set and joins two vertices exactly when they differ in one coordinate. It is a -regular bipartite graph on vertices.