Herschel graph

English dictionary entry

Meanings

name
  1. A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.

Word forms

Herschel graph

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.

Synonyms

Herschel's graph
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.