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
V-Cube 6 the internal shape of the pieces is asymmetrical), nor can an inner edge exchange places with an outer edge. The four edges in each matching quartet are distinguishable, since corresponding edges are mirror images of each other. Any permutation of the edges in each set is possible, including odd permutations, giving 24! arrangements for each set or 24! total, regardless of the position or orientation any other pieces. Assuming the cube does not have a fixed orientation in space, and that the permutations resulting from rotating the cube without twisting it are considered identical, the number of permutations is reduced