Soicher Graphs

Download Wolfram Notebook

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 , 3.

See also

Moscow-Soicher Graph

Explore with Wolfram|Alpha

More things to try:

References

Bailey, R. F. and Hawtin, D. R. "On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher." Elec. J. Combin. 27, P3.13, 2020. https://doi.org/10.37236/8954.DistanceRegular.org. "Soicher's 1st graph." https://www.math.mun.ca/distanceregular/graphs/soicher1st.html.DistanceRegular.org. "Soicher's 2nd graph." https://www.math.mun.ca/distanceregular/graphs/soicher2nd.html.DistanceRegular.org. "Soicher's 3rd graph." https://www.math.mun.ca/distanceregular/graphs/soicher3rd.html.Soicher, L. H. "Three New Distance-Regular Graphs." Europ. J. Combin. 14, 501-505, 1993. https://doi.org/10.1006/eujc.1993.1052.

Referenced on Wolfram|Alpha

Cite this as:

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

Subject classifications