Hypercube graph

In graph theory, the hypercube graph Q_n is the graph formed from the vertices and edges of an n-dimensional hypercube. For instance, the cubical graph Q₃ is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. Q_n has 2 vertices, 2n edges, and is a regular graph with n edges touching each vertex.