The SylvesterGraph() command returns the Sylvester graph, a distance-regular graph with 36 vertices and 90 edges.

The Sylvester graph is a subgraph of the Hoffman-Singleton graph and the Cameron graph.

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

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

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

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

$\mathrm{IsBipartite}\left(G\right)$

$\mathrm{false}$

$\mathrm{DrawGraph}\left(G\right)$

"Sylvester graph", Wikipedia. http://en.wikipedia.org/wiki/Sylvester_graph

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

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