The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters 
.
It is distance-regular but not distance-transitive with intersection
array 
and has graph spectrum 
.
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.distanceregular.org/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.
Cite this as:
Weisstein, Eric W. "Moscow-Soicher Graph."
From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Moscow-SoicherGraph.html
Subject classifications
