DistanceRegular.org
Soicher's 2
nd
graph
Number of vertices:
$486$
Diameter:
$4$
Intersection array:
$\{56,45,16,1;1,8,45,56\}$
Spectrum:
$56^1 14^{72} 2^{140} (-4)^{252} (-16)^{21}$
Automorphism group:
$3.PSU(4,3):2^2$
Distance-transitive:
Yes
Antipodal
Downloads
Adjacency matrix
Adjacency matrix in GAP format
Adjacency matrix in CSV format
Graph in GRAPE format
References
L.H. Soicher,
Three new distance-regular graphs
,
European J. Combin.
14
(1993), 501–505.
R.F. Bailey and D.R. Hawtin,
On the 486-vertex distance-regular graphs of Koolen–Riebeek and Soicher
,
Electronic J. Combin.
27
(2020), P3.13 (12pp).
Back to:
A-Z index
•
Graphs with 301-500 vertices
•
Graphs with diameter 4
•
Graphs from Golay code and Witt designs
Last updated: 21 March 2024