 HoffmanSingletonGraph - Maple Help

GraphTheory[SpecialGraphs]

 HoffmanSingletonGraph
 construct Hoffman-Singleton graph Calling Sequence HoffmanSingletonGraph() Description

 • The HoffmanSingletonGraph() command returns the Hoffman-Singleton graph, a 7-regular undirected graph with 50 vertices and 175 edges. Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{HoffmanSingletonGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 50 vertices and 175 edge\left(s\right)}}$ (1)
 > $\mathrm{IsBipartite}\left(G\right)$
 ${\mathrm{false}}$ (2)
 > $\mathrm{IsStronglyRegular}\left(G,'\mathrm{parameters}'\right)$
 ${\mathrm{true}}{,}\left[{7}{,}{0}{,}{1}\right]$ (3)
 > $\mathrm{DrawGraph}\left(G\right)$  References

 "Hoffman-Singleton graph", Wikipedia. http://en.wikipedia.org/wiki/Hoffman-Singleton_graph
 Hoffman, A. J. and Singleton, R. R. "On Moore Graphs of Diameter Two and Three." IBM J. Res. Develop. 4, 497-504, 1960.