“Bidiakis cube”的意思、由来-开放百科全书

词条

Bidiakis cube

释义

Construction
Algebraic properties
Gallery
References

{{infobox graph
| name = Bidiakis cube
| image =
| image_caption = The Bidiakis cube
| namesake =
| vertices = 12
| edges = 18
| automorphisms = 8 (D₄)
| girth = 4
| diameter = 3
| radius = 3
| chromatic_number = 3
| chromatic_index = 3
| properties = Cubic
Hamiltonian
Triangle-free
Polyhedral
Planar
}}

In the mathematical field of graph theory, the Bidiakis cube is a 3-regular graph with 12 vertices and 18 edges.^[1]

Construction

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 theorem, it is a 3-vertex-connected simple planar graph.^[2]^[3]

Algebraic properties

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 .

Gallery

References

1. ^{{MathWorld|urlname=BidiakisCube|title=Bidiakis cube}}
2. ^Branko Grünbaum, Convex Polytopes, 2nd edition, prepared by Volker Kaibel, Victor Klee, and Günter M. Ziegler, 2003, {{ISBN|0-387-40409-0}}, {{ISBN|978-0-387-40409-7}}, 466pp.
3. ^{{MathWorld|urlname=PolyhedralGraph|title=Polyhedral Graph}}

3 : Individual graphs|Regular graphs|Planar graphs

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。