A dimension-k folded cube graph is a k-regular with 2k − 1 vertices and 2k − 2k edges.

[3] When k is odd, the dimension-k folded cube contains as a subgraph a complete binary tree with 2k − 1 nodes.

[4] In parallel computing, folded cube graphs have been studied as a potential network topology, as an alternative to the hypercube.

Compared to a hypercube, a folded cube with the same number of nodes has nearly the same vertex degree but only half the diameter.

Efficient distributed algorithms (relative to those for a hypercube) are known for broadcasting information in a folded cube.