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
Professor's Cube of the puzzle uses a different mechanism. The fixed centers hold the centers next to the central edges in place, which in turn hold the outer edges. The non-central edges hold the corners in place, and the internal sections of the corner pieces do not reach the center of the cube. The V-Cube 5 mechanism, designed by Panagiotis Verdes, has elements in common with both. The corners reach to the center of the puzzle (like the original mechanism) and the center pieces hold the central edges in place (like the Eastsheen mechanism). The middle edges and center pieces adjacent to