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
8-cube the column element. The configurations for dual polytopes can be seen by rotating the matrix elements by 180 degrees. formula_1 The diagonal f-vector numbers are derived through the Wythoff construction, dividing the full group order of a subgroup order by removing one mirror at a time. Applying an "alternation" operation, deleting alternating vertices of the octeract, creates another uniform polytope, called a "8-demicube", (part of an infinite family called demihypercubes), which has 16 demihepteractic and 128 8-simplex facets. 8-cube In geometry, an 8-cube is an eight-dimensional hypercube (8-cube). It has 256 vertices, 1024 edges, 1792 square faces, 1792 cubic cells,