Heawood graph

English

Etymology

Named after Percy John Heawood.

Noun

Heawood graph (plural Heawood graphs)

  1. (graph theory) An undirected graph with 14 vertices and 21 edges.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.