![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Goldner-Harary_graph.svg/640px-Goldner-Harary_graph.svg.png&w=640&q=50)
Goldner–Harary graph
Undirected graph with 11 nodes and 27 edges / From Wikipedia, the free encyclopedia
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.[1][2][3] The same graph had already been given as an example of a non-Hamiltonian simplicial polyhedron by Branko Grünbaum in 1967.[4]
Quick Facts Named after, Vertices ...
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 |
Close