Herschel graph
Bipartite non-Hamiltonian polyhedral graph / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Herschel graph?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the graph of a convex polyhedron), and is the smallest polyhedral graph that does not have a Hamiltonian cycle, a cycle passing through all its vertices. It is named after British astronomer Alexander Stewart Herschel, because of Herschel's studies of Hamiltonian cycles in polyhedral graphs (but not of this graph).
Quick Facts Named after, Vertices ...
Herschel graph | |
---|---|
Named after | Alexander Stewart Herschel |
Vertices | 11 |
Edges | 18 |
Automorphisms | 12 (D6) |
Properties | |
Table of graphs and parameters |
Close