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
Floppy Cube companies. The key difference between this puzzle and the Floppy Cube is that the Floppy Cube is restricted to only 180° rotations (i.e. an edge piece cannot be twisted 90°), while the Super Floppy Cube does allow edges to rotate 90°. This in turn allows the corner pieces to move to locations "above" and "below" the edge pieces and thus change the shape of the puzzle. There is also a subtle difference between the original version of the puzzle and the version mass-produced by other companies. The original puzzle has an internal mechanism which prevents an isolated edge piece from