Noun
Heawood graph (plural Heawood graphs) (graph theory) An undirected graph with 14 vertices and 21 edges.