SylvesterGraph - Maple Help

GraphTheory[SpecialGraphs]

 SylvesterGraph
 construct Sylvester graph

 Calling Sequence SylvesterGraph()

Description

 • 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.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{SylvesterGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 36 vertices and 90 edge\left(s\right)}}$ (1)
 > $\mathrm{IsBipartite}\left(G\right)$
 ${\mathrm{false}}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$

References

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

Compatibility

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