Graph Theory

Hypercube Graph

For $n\ge 0$, the $n$-cube is the graph whose vertex set consists of all binary strings of length $n$, and two vertices (strings) are adjacent if and only if they differ in exactly one position.

Properties of the hypbercube

• Number of edges: $n{2}^{n-1}$
• Is $n$-regular
• Is a Bipartite Graph