Please note that the content of this book primarily consists of articles
available from Wikipedia or other free sources online. 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. The folded cube graph of order k may be formed by
adding edges between opposite pairs of vertices in a hypercube graph of
order k ¿ 1. It can, equivalently, be formed from a hypercube graph of
order k, which has twice as many vertices, by identifying together every
opposite pair of vertices.
