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

$\mathrm{with}\left(\mathrm{GraphTheory}\right)\:$

$\mathrm{with}\left(\mathrm{SpecialGraphs}\right)\:$

$G≔\mathrm{CameronGraph}\left(\right)$

$G≔\mathrm{Graph\; 1:\; an\; undirected\; graph\; with\; 231\; vertices\; and\; 3465\; edge(s)}$

$\mathrm{IsStronglyRegular}\left(G\,\mathrm{parameters}\right)$

$\mathrm{true},\left[30\,9\,3\right]$

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

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

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