DistanceRegular.org
$\text{Moscow-Soicher Graph}$
Number of vertices:
$672$
Diameter:
$3$
Intersection array:
$\{110,81,12;1,18,90\}$
Spectrum:
$110^1 26^{55} 2^{385} (-10)^{231}$
Automorphism group:
$M_{22}:2$
Distance-transitive:
$\text{No}$
Primitive
$\text{Downloads}$
$\text{Adjacency matrix}$
$\text{Adjacency matrix in GAP format}$
$\text{Adjacency matrix in CSV format}$
$\text{Graph in GRAPE format}$
References
L.H Soicher,
Yet another distance-regular graph related to Golay code
, Electronic J. Combin. 2 (1995), N1, 4pp.
Back to:
A-Z index
•
Graphs with more than 200 vertices
•
Graphs with diameter 3
•
Graphs from Golay code and Witt designs
Last updated: 10 March 2019