Bidiakis cube 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 by adding edges across the top and bottom faces which connect the centres of opposite sides of the faces. The two additional edges need to be perpendicular to each other. With this construction, the Bidiakis cube is a polyhedral graph, and can be realized as a convex polyhedron. Therefore, by Steinitz's
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