construct Harborth graph
The HarborthGraph() command constructs the Harborth graph.
The Harborth graph is a 4-regular graph with 52 vertices and 104 edges, named after H. Harborth. It is the smallest known 4-regular matchstick graph.
H ≔ HarborthGraph⁡
H≔Graph 1: an undirected graph with 52 vertices and 104 edge(s)
"Matchstick graph", Wikipedia. http://en.wikipedia.org/wiki/Matchstick_graph
The GraphTheory[SpecialGraphs][HarborthGraph] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document