Herschel graph

Hello, you have come here looking for the meaning of the word Herschel graph. In DICTIOUS you will not only get to know all the dictionary meanings for the word Herschel graph, but we will also tell you about its etymology, its characteristics and you will know how to say Herschel graph in singular and plural. Everything you need to know about the word Herschel graph you have here. The definition of the word Herschel graph will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofHerschel graph, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

The 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.

Pronunciation

Proper noun

Herschel graph

  1. (mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.
    • 1994, Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, page 587:
      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.
    • 2004, William Kocay, Donald L. Kreher, Graphs, Algorithms, and Optimization, page 202:
      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.
    • 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 shows that a convex polyhedron need not be Hamiltonian as a graph.

Synonyms

See also