Bidiakis cube theorem, it is a 3-vertex-connected simple planar graph. The Bidiakis cube is not a vertex-transitive graph and its full automorphism group is isomorphic to the dihedral group of order 8, the group of symmetries of a square, including both rotations and reflections. The characteristic polynomial of the Bidiakis cube is formula_1. Bidiakis cube In the mathematical field of graph theory, the Bidiakis cube is a 3-regular graph with 12 vertices and 18 edges. The Bidiakis cube is a cubic Hamiltonian graph and can be defined by the LCF notation [-6,4,-4]. The Bidiakis cube can also be constructed from a cube
Folded cube graph 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. The folded cube graph of order "k" (containing 2 vertices) may be formed by adding edges between opposite pairs of vertices in a hypercube graph of order "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 order "k", which has twice