Definitions from Wiktionary (Herschel graph)
▸ noun: (mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.
▸ Words similar to Herschel graph
▸ Usage examples for Herschel graph
▸ Idioms related to Herschel graph
▸ Wikipedia articles (New!)
▸ Words that often appear near Herschel graph
▸ Rhymes of Herschel graph
▸ Invented words related to Herschel graph
▸ noun: (mathematics, graph theory) A bipartite undirected graph with 11 vertices and 18 edges that is the smallest non-Hamiltonian polyhedral graph.
Similar:
Heawood graph,
utility graph,
Hamiltonian graph,
thickness,
Schönhardt polyhedron,
hypergraph,
Levi graph,
bigraph,
multihypergraph,
complete bipartite graph,
more...
Opposite:
▸ Words similar to Herschel graph
▸ Usage examples for Herschel graph
▸ Idioms related to Herschel graph
▸ Wikipedia articles (New!)
▸ Words that often appear near Herschel graph
▸ Rhymes of Herschel graph
▸ Invented words related to Herschel graph