GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory[SpecialGraphs]

  

DoyleGraph

  

construct Doyle graph

 

Calling Sequence

Description

Examples

References

Compatibility

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

withGraphTheory:

withSpecialGraphs:

GDoyleGraph

GGraph 1: an undirected unweighted graph with 27 vertices and 54 edge(s)

(1)

GroupTheory:-GroupOrderAutomorphismGroupG

54

(2)

DrawGraphG

References

  

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

Compatibility

• 

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

• 

For more information on Maple 2018 changes, see Updates in Maple 2018.

See Also

SpecialGraphs