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
Rubik's Cube group define orientation. One choice is the following group, given by generators (the last generator is a 3 cycle on the edges): Since "C" is a normal subgroup and the intersection of "C" and "C" is the identity and their product is the whole cube group, it follows that the cube group "G" is the semi-direct product of these two groups. That is Next we can take a closer look at these two groups. The structure of "C" is since the group of rotations of each corner (resp. edge) cube is formula_30 (resp. formula_31), and in each case all but one