Herschel Graph Definition
A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph .
Wiktionary
Origin of Herschel Graph
-
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 .
From Wiktionary
Related Articles
Find Similar Words
Find similar words to Herschel graph using the buttons below.