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
7-cube 7-cube In geometry, a 7-cube is a seven-dimensional hypercube with 128 vertices, 448 edges, 672 square faces, 560 cubic cells, 280 tesseract 4-faces, 84 penteract 5-faces, and 14 hexeract 6-faces. It can be named by its Schläfli symbol {4,3}, being composed of 3 6-cubes around each 5-face. It can be called a hepteract, a portmanteau of tesseract (the "4-cube") and "hepta" for seven (dimensions) in Greek. It can also be called a regular tetradeca-7-tope or tetradecaexon, being a 7 dimensional polytope constructed from 14 regular facets. It is a part of an infinite family of polytopes, called hypercubes. The dual