Herschel graph
id:
herschel-graph-265-18486011
title:
Herschel graph
text:
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, 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Bipartite non-Hamiltonian polyhedral graph
original url:
https://en.wikipedia.org/wiki/Herschel_graph
date created:
date modified:
2023-12-06T07:10:52Z
main entity:
{"identifier":"Q3115504","url":"https://www.wikidata.org/entity/Q3115504"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/a/ae/Herschel_graph_LS.svg","width":324,"height":288}
fields total:
13
integrity:
15