Bidiakis cube
From Wikipedia, the free encyclopedia
| Bidiakis cube | |
|---|---|
 The bidiakis cube | |
| Vertices | 12 |
| Edges | 18 |
| Radius | 3 |
| Diameter | 3 |
| Girth | 4 |
| Automorphisms | 8 (D4) |
| Chromatic number | 3 |
| Chromatic index | 3 |
| Properties | Cubic Hamiltonian Triangle-free Polyhedral Planar |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the bidiakis cube is a 3-regular graph with 12 vertices and 18 edges.[1]
The bidiakis cube is a cubic Hamiltonian graph and can be defined by the LCF notation [−6,4,−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 theorem, it is a 3-vertex-connected simple planar graph.[2]
