Folded cube graph

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.

Folded cube graph
The dimension-5 folded cube graph (i.e, the Clebsch graph).
Vertices	${\displaystyle 2^{n-1}}$
Edges	${\displaystyle 2^{n-2}n}$
Diameter	${\displaystyle \left\lfloor {\frac {n}{2}}\right\rfloor }$
Chromatic number	${\displaystyle {\begin{cases}2&{\text{even }}n\\4&{\text{odd }}n\end{cases}}}$
Properties	Regular Hamiltonian Distance-transitive.
Table of graphs and parameters