GraphTheory[SpecialGraphs]
DuererGraph
construct Duerer graph
Calling Sequence
Description
Examples
References
Compatibility
DuererGraph()
The DuererGraph() command constructs the Dürer graph, a planar cubic graph with 12 vertices and 18 edges.
It is derived from Dürer's solid, a polyhedron first seen in an engraving by Albrecht Dürer.
with⁡GraphTheory:
with⁡SpecialGraphs:
G ≔ DuererGraph⁡
G≔Graph 1: an undirected graph with 12 vertices and 18 edge(s)
IsPlanar⁡G
true
ChromaticNumber⁡G
3
Diameter⁡G
4
GroupTheory:-GroupOrder⁡AutomorphismGroup⁡G
12
DrawGraph⁡G
"Dürer graph", Wikipedia. http://en.wikipedia.org/wiki/Duerer_graph
The GraphTheory[SpecialGraphs][DuererGraph] command was introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
See Also
SpecialGraphs
Download Help Document
What kind of issue would you like to report? (Optional)