The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not.

The second and third Soicher graphs are implemented in the Wolfram Language as `GraphData`[`"Soicher"`, *n*] for .

## See also

Moscow-Soicher 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.
"Soicher's 1st graph." https://www.distanceregular.org/graphs/soicher1st.html.DistanceRegular.org.
"Soicher's 2nd graph." https://www.distanceregular.org/graphs/soicher2nd.html.DistanceRegular.org.
"Soicher's 3rd graph." https://www.distanceregular.org/graphs/soicher3rd.html.Soicher,
L. H. "Three New Distance-Regular Graphs." *Europ. J. Combin.* **14**,
501-505, 1993.
## Cite this as:

Weisstein, Eric W. "Soicher Graphs." From
*MathWorld*--A Wolfram Web Resource. https://mathworld.wolfram.com/SoicherGraphs.html

## Subject classifications