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
Bhargava cube the edges of the corresponding faces. The integer binary quadratic form associated with this pair of faces is defined as The quadratic form is also defined as However, the former definition will be assumed in the sequel. Let the cube be formed by the integers "a", "b", "c", "d", "e", "f", "g", "h". The pairs of matrices associated with opposite edges are denoted by ("M", "N"), ("M", "N"), and ("M", "N"). The first rows of "M", "M" and "M" are respectively ["a" "b"], ["a" "c"] and ["a" "e"]. The opposite edges in the same face are the second rows. The