Soicher Graphs

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 n=2,3.

See also

Moscow-Soicher 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. "Soicher's 1st graph." "Soicher's 2nd graph." "Soicher's 3rd graph.", 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.

Subject classifications