Herschel graph

专有名词

英文释义

专有名词
  1. A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.
    — Select a suitable independent set / and use part (b) to show that the graph in Fig. 11.81 (known as the Herschel graph) has no Hamilton cycle.

词源

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.
0 次浏览 数据来源: Wiktionary