Goldner–Harary graph
id:
goldner-harary-graph-236-11247440
title:
Goldner–Harary graph
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Undirected graph with 11 nodes and 27 edges
original url:
https://en.wikipedia.org/wiki/Goldner%E2%80%93Harary_graph
date created:
date modified:
2024-04-17T20:01:28Z
main entity:
{"identifier":"Q3115488","url":"https://www.wikidata.org/entity/Q3115488"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/96/Goldner-Harary_graph.svg","width":520,"height":320}
fields total:
13
integrity:
15