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
Compound of 5-cube and 5-orthoplex cells and edges. Mid-edges of the 5-cube cross mid-cell in the 16-cell, and vice versa. It can be seen as the 5-dimensional analogue of a compound of cube and octahedron. The 42 Cartesian coordinates of the vertices of the compound are. The convex hull of the vertices makes the dual of rectified 5-orthoplex. The intersection of the 5-cube and 5-orthoplex compound is the uniform birectified 5-cube: = ∩ . The compound can be seen in projection as the union of the two polytope graphs. The convex hulll as the dual of the rectified 5-orthoplex will have the same vertices, but