HeawoodGraph - Maple Help

GraphTheory[SpecialGraphs]

 HeawoodGraph
 construct Heawood graph

 Calling Sequence HeawoodGraph()

Description

 • The HeawoodGraph() command returns the Heawood graph, an undirected graph with 14 vertices and 21 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{HeawoodGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 14 vertices and 21 edge\left(s\right)}}$ (1)
 > $\mathrm{IsBipartite}\left(G\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Heawood graph", Wikipedia. http://en.wikipedia.org/wiki/Heawood_graph