GraphTheory[SpecialGraphs] - Maple Programming Help

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

GraphTheory[SpecialGraphs]

 CameronGraph
 construct Cameron graph

 Calling Sequence CameronGraph()

Description

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

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{CameronGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 231 vertices and 3465 edge\left(s\right)}}$ (1)
 > $\mathrm{IsStronglyRegular}\left(G,\mathrm{parameters}\right)$
 ${\mathrm{true}}{,}\left[{30}{,}{9}{,}{3}\right]$ (2)

References

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

Compatibility

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