close
Image TOPICS
Image
Search

Moscow-Soicher Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)).

It is distance-regular but not distance-transitive with intersection array {110,81,12;1,18,90} and has graph spectrum (-10)^(231)2^(385)26^(55)110^1.

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

See also

Distance-Regular Graph, Weakly Regular Graph

Explore with Wolfram|Alpha

References

Bailey, R. F. and Hawtin, D. R. "On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher." 12 Jul 2020. https://arxiv.org/abs/1908.07104.DistanceRegular.org. "Moscow-Soicher Graph." https://www.math.mun.ca/distanceregular/graphs/moscow-soicher.html.Soicher, L. H. "Yet Another Distance-Regular Graph Related to a Golay Code." Electronic J. Combin. 2, No. N1, 1995. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v2i1n1.

Referenced on Wolfram|Alpha

Moscow-Soicher Graph

Cite this as:

Weisstein, Eric W. "Moscow-Soicher Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Moscow-SoicherGraph.html

Subject classifications