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

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

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

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

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

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

$\mathrm{false}$

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

$\mathrm{true},\left[7\,0\,1\right]$

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

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