In graph theory, the hypercube graph Q n {\displaystyle Q_{n}} is the edge graph of the n {\displaystyle n} -dimensional hypercube, that is, it is the graph formed from the vertices and edges of the hypercube. For instance, the cube graph Q 3 {\displaystyle Q_{3}} is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube.
In graph theory, the hypercube graph Q n {\displaystyle Q_{n}} is the edge graph of the n {\displaystyle n} -dimensional hypercube, that is, it is the graph formed from the vertices and edges of the hypercube. For instance, the cube graph Q 3 {\displaystyle Q_{3}} is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube.
Source: Wikipedia "Hypercube graph" · CC BY-SA 4.0
Share this article: X · Bluesky