Goldner–Harary graph
In the mathematical field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. It is named after A. Goldner and Frank Harary, who proved in 1975 that it was the smallest non-Hamiltonian maximal planar graph. The same graph had already been given as an example of a non-Hamiltonian simplicial polyhedron by Branko Grünbaum in 1967.
| Goldner–Harary graph | |
|---|---|
| Named after | A. Goldner, Frank Harary |
| Vertices | 11 |
| Edges | 27 |
| Radius | 2 |
| Diameter | 2 |
| Girth | 3 |
| Automorphisms | 12 (D6) |
| Chromatic number | 4 |
| Chromatic index | 8 |
| Properties | Polyhedral Planar Chordal Perfect Treewidth 3 |
| Table of graphs and parameters | |
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.