GoldnerHararyGraph - Maple Help

GraphTheory[SpecialGraphs]

 GoldnerHararyGraph
 construct Goldner-Harary graph

 Calling Sequence GoldnerHararyGraph()

Description

 • The GoldnerHararyGraph command creates the Goldner-Harary graph.
 • The Goldner-Harary graph is a planar non-Hamiltonian graph with 11 vertices and 27 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{GoldnerHararyGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 11 vertices and 27 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(G\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{ChromaticNumber}\left(G\right)$
 ${4}$ (3)

References

 "Goldner-Harary graph", Wikipedia. http://en.wikipedia.org/wiki/Goldner-Harary_graph

Compatibility

 • The GraphTheory[SpecialGraphs][GoldnerHararyGraph] command was introduced in Maple 2021.