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
Snub cube plus signs, where "t" ≈ 1.83929 is the tribonacci constant. Taking the even permutations with an odd number of plus signs, and the odd permutations with an even number of plus signs, gives a different snub cube, the mirror image. Taking all of them together yields the compound of two snub cubes. This snub cube has edges of length "α", a number which satisfies the equation and can be written as To get a snub cube with unit edge length, divide all the coordinates above by the value "α" given above. The "snub cube" has two special orthogonal projections, centered,