Dürer graph
| Dürer graph | |
|---|---|
The Dürer graph | |
| Named after | Albrecht Dürer |
| Vertices | 12 |
| Edges | 18 |
| Radius | 3 |
| Diameter | 4 |
| Girth | 3 |
| Automorphisms | 12 (D6) |
| Chromatic number | 3 |
| Chromatic index | 3 |
| Properties | Cubic Planar Unit distance Well-covered |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving Melencolia I includes a depiction of Dürer's solid, a convex polyhedron having the Dürer graph as its skeleton. Dürer's solid is one of only four well-covered simple convex polyhedra.