Bidiakis cube 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 by adding edges across the top and bottom faces which connect the centres of opposite sides of the faces. The two additional edges need to be perpendicular to each other. With this construction, the Bidiakis cube is a polyhedral graph, and can be realized as a convex polyhedron. Therefore, by Steinitz's
V-Cube 8 The six edges in each matching sextet 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 by a factor of 24. This is because the 24 possible positions and orientations of the first corner are