In graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects opposite pairs of hypercube vertices. == Construction == The folded cube graph of dimension k (containing 2k − 1 vertices) may be formed by adding edges between opposite pairs of vertices in a hypercube graph of dimension k − 1.
In graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects opposite pairs of hypercube vertices. == Construction == The folded cube graph of dimension k (containing 2k − 1 vertices) may be formed by adding edges between opposite pairs of vertices in a hypercube graph of dimension k − 1.
Source: Wikipedia "Folded cube graph" · CC BY-SA 4.0
Share this article: X · Bluesky