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
Edge (video game) assigned a rank based on their performance. Rank is affected by how fast the level is completed, how many prisms are obtained, and how many times the cube falls off the map. The player can reduce the time by making the Cube hang on edges and ledges of the map. The player can make the cube climb over steps. By balancing the cube along the edge of a wall or space, the player can hang across certain edges in order to cross large gaps. In addition to dragging across the scene, the game can be controlled by on-screen keys or