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 5-cube In five-dimensional geometry, a 5-cube is a name for a five-dimensional hypercube with 32 vertices, 80 edges, 80 square faces, 40 cubic cells, and 10 tesseract 4-faces. It is represented by Schläfli symbol {4,3,3,3} or {4,3}, constructed as 3 tesseracts, {4,3,3}, around each cubic ridge. It can be called a penteract, a portmanteau of tesseract (the "4-cube") and "pente" for five (dimensions) in Greek. It can also be called a regular deca-5-tope or decateron, being a 5-dimensional polytope constructed from 10 regular facets. It is a part of an infinite hypercube family. The dual of a 5-cube is the