English Dictionary

Herschel graph

固有名詞

(mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.

日本語の意味

数学・グラフ理論において、11頂点18辺を持つ二部対立無向グラフであり、最小のハミルトン閉路を持たない多面体グラフ。

The Herschel graph serves as a classic counterexample in graph theory, being the smallest non-Hamiltonian polyhedral graph: a bipartite undirected graph with eleven vertices and eighteen edges.

このグラフは、グラフ理論における古典的な反例として知られており、頂点11個、辺18本の二部無向グラフで、最小の非ハミルトン多面体グラフです。

意味（1）

(mathematics, graph theory) 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.