Moscow-Soicher Graph

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


Bailey, R. F. and Hawtin, D. R. "On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher." 12 Jul 2020. "Moscow-Soicher Graph.", L. H. "Yet Another Distance-Regular Graph Related to a Golay Code." Electronic J. Combin. 2, No. N1, 1995.

Cite this as:

Weisstein, Eric W. "Moscow-Soicher Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications