Folded cube graph | |
---|---|
Vertices | |
Edges | |
Diameter | |
Chromatic number | |
Properties | Regular Hamiltonian Distance-transitive. |
Table of graphs and parameters |
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.