construct Sylvester graph
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.
G ≔ SylvesterGraph⁡
G≔Graph 1: an undirected graph with 36 vertices and 90 edge(s)
"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.
Download Help Document
What kind of issue would you like to report? (Optional)