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
Gear Cube between. - Place those two edges on the top side and complete the following algorithm: (U2 R4) 2. Step 2: Repeat the previous step until all edge pieces are in the correct position (edge colors match the colors of the sides it is between). Phase 3: Orient the edges: (second algorithm used) Step 1: Rotate all sides until the cube is back in a cubic state using the following algorithm: R4 (repeat as necessary). There are multiple variations of the Gear Cube, ranging from the most simple, a 2x2 Gear Shift, to the most complicated, the 3x3 Even Less Gears