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/CameronGraph

GraphTheory[SpecialGraphs]

  

CameronGraph

  

construct Cameron graph

 

Calling Sequence

Description

Examples

References

Compatibility

Calling Sequence

CameronGraph()

Description

• 

The CameronGraph() command returns the Cameron graph, a strongly regular graph with 231 vertices and 3465 edges.

Examples

withGraphTheory:

withSpecialGraphs:

GCameronGraph

GGraph 1: an undirected unweighted graph with 231 vertices and 3465 edge(s)

(1)

IsStronglyRegularG,parameters

true,30,9,3

(2)

References

  

"Cameron graph", Wikipedia. http://en.wikipedia.org/wiki/Cameron_graph

Compatibility

• 

The GraphTheory[SpecialGraphs][CameronGraph] command was introduced in Maple 2019.

• 

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

See Also

IsStronglyRegular

SpecialGraphs