TOPICS
Search

Norton-Smith Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)).

It is distance-regular as well as distance-transitive with intersection array {117,80,24,1;1,12,80,117} and has graph spectrum (-9)^(195)(-3)^(702)9^(182)39^(54)117^1.

It is implemented in the Wolfram Language as GraphData["NortonSmithGraph"].

See also

Distance-Regular Graph, Distance-Transitive Graph, Weakly Regular Graph

Explore with Wolfram|Alpha

References

DistanceRegular.org. "Norton-Smith graph." https://www.math.mun.ca/distanceregular/graphs/norton-smith.html.Norton, S. P. "On the Group Fi_(24)." Geom. Dedicata 25, 483-501, 1988.

Referenced on Wolfram|Alpha

Norton-Smith Graph

Cite this as:

Weisstein, Eric W. "Norton-Smith Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Norton-SmithGraph.html

Subject classifications