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
5-cube rhombic icosahedron envelope. There are 22 exterior vertices, and 10 interior vertices. The 10 interior vertices have the convex hull of a pentagonal antiprism. The 80 edges project into 40 external edges and 40 internal ones. The 40 cubes project into golden rhombohedra which can be used to dissect the rhombic icosahedron. The projection vectors are u = {1, φ, 0, -1, φ}, v = {φ, 0, 1, φ, 0}, w = {0, 1, φ, 0, -1}, where φ is the golden_ratio, formula_2. This polytope is one of 31 uniform 5-polytopes generated from the regular 5-cube or 5-orthoplex. 5-cube In