Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js
DistanceRegular.org
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:
No
Primitive
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
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 501-1000 vertices
•
Graphs with diameter 3
•
Graphs from Golay code and Witt designs
Last updated: 29 February 2024