graph of dimension k − 1. (In a hypercube with 2ⁿ vertices, a pair of vertices are opposite if the shortest path between them has length n.) It can, equivalently, be formed from a hypercube graph (also) of dimension k, which has twice as many vertices, by identifying together (or contracting) every opposite pair of vertices.

Properties

A dimension-k folded cube graph is a k-regular with 2^k − 1

1.Previous
3.Next