 GraphTheory[SpecialGraphs] - Maple Programming Help

Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/DoyleGraph

GraphTheory[SpecialGraphs]

 DoyleGraph
 construct Doyle graph

 Calling Sequence DoyleGraph()

Description

 • The DoyleGraph() command returns the Doyle graph, also known as the Holt graph, an undirected graph with 27 vertices and 54 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{DoyleGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 27 vertices and 54 edge\left(s\right)}}$ (1)
 > $\mathrm{GroupTheory}:-\mathrm{GroupOrder}\left(\mathrm{AutomorphismGroup}\left(G\right)\right)$
 ${54}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$ References

 "Doyle graph", Wikipedia. http://en.wikipedia.org/wiki/Doyle_graph

Compatibility

 • The GraphTheory[SpecialGraphs][DoyleGraph] command was introduced in Maple 2018.