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 for the largest square that lies within a unit cube. More generally, show how to find the largest rectangle of a given aspect ratio that lies within a unit cube. As they show, the optimal rectangle must always pass through the center of the cube, with its vertices on edges of the cube. Based on this, they show, depending on the desired aspect ratio, that the optimal rectangle must either lie on a plane that cuts diagonally through four corners of the cube, or it must be formed by an isosceles right triangle on one corner of the cube and