Herschel graph
Herschel graph proper noun: a bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.
Proper noun
Herschel graph
- 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.1994, Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, page 587
- A bipartite graph like the Herschel graph of Figure 9.2 is also non-hamiltonian, but the algorithm is not likely to delete enough vertices to notice that it has a large separating set.2004, William Kocay, Donald L. Kreher, Graphs, Algorithms, and Optimization, page 202
- Synonyms:
- Herschel's graph
Synonyms of Herschel graph
- Herschel's graph
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.
Words that rhyme with Herschel graph
Questions about Herschel graph
- What does Herschel graph mean?
- Herschel graph means a bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.
- What part of speech is Herschel graph?
- Herschel graph is a proper noun.
Words near Herschel graph in the dictionary
Source and license
Adapted from Wiktionary: Herschel graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Herschel graph.” Word.ws, https://word.ws/herschel_graph. Based on Wiktionary, CC BY-SA 4.0.