Herschel graph

== English == === Etymology === From Herschel (“a surname”) + graph, after British astronomer Alexander Stewart Herschel (1836—1907), who identified the associated polyhedron (an enneahedron) as one for which there is no solution to the icosian game. === Pronunciation === Rhymes: -æf === Proper noun === Herschel graph (mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph. 2006, Michael S. Keane, Dee Denteneer, Frank Hollander, Evgeny Verbitskiy, Dynamics and Stochastics, Institute of Mathematical Statistics, Lecture Notes—Monograph Series, Volume 48, page 174, It is difficult to control what loops may arise: for example the Herschel graph [3] shows that a convex polyhedron need not be Hamiltonian as a graph. ==== Synonyms ==== (smallest non-Hamiltonian polyhedral graph): Herschel's graph === See also === icosian game on Wikipedia.Wikipedia