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
Impossible cube ambiguity present in a Necker cube illustration, in which a cube is drawn with its edges as line segments, and can be interpreted as being in either of two different three-dimensional orientations. An impossible cube is usually rendered as a Necker cube in which the line segments representing the edges have been replaced by what are apparently solid beams. In Escher's print, the top four joints of the cube, and the upper of the two crossings between its beams, match one of the two interpretations of the Necker cube, while the bottom four joints and the bottom crossing match the