Hypercube graph
Summary
In graph theory, the hypercube graph is the edge graph of the -dimensional hypercube, that is, it is the graph formed from the vertices and edges of the hypercube. For instance, the cube graph is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. has vertices, edges, and is a regular graph with edges touching each vertex.
Further reading
- Wikipedia, page 6706815, revision 1366110735, Hypercube graph. adopted
About this page
| Tag | VG7DWJBYB9 |
|---|---|
| URI | m2://VG7DWJBYB9 |
| Aliases | cube-graph, q-n |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.