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
Prince Rupert's cube be passed through a hole made in another cube "of the same size" without splitting the cube into two pieces. If two points are placed on two adjacent edges of a unit cube, each at a distance of 3/4 from the point where the two edges meet, then the distance between the two points will be These two points, together with a second set of two points placed symmetrically on the opposite face of the cube, form the four vertices of a square that lies entirely within the unit cube. This square, extruded in both directions perpendicularly to itself, forms