TOPICS
The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it one of the subconstituents of the McLaughlin graph.
It is a strongly regular graph with parameters 
.
It is determined by spectrum and has graph spectrum 
(van Dam and Haemers 2003). It has independence number 21 and 324 maximum
independent vertex sets (Brouwer).
on 162 Points." http://www.win.tue.nl/~aeb/graphs/U4_3a.html.Cameron,
P. J.; Goethals, J. M.; and Seidel, J. J. "Strongly Regular Graph
having Strongly Regular Subconstituents." J. Algebra 55, 257-280,
1978.Godsil, C. and Royle, G. Algebraic
Graph Theory. New York: Springer-Verlag, 2001.Soicher, L. H.
"Three New Distance-Regular Graphs." Europ. J. Combin. 14,
501-505, 1993.van Dam, E. R. and Haemers, W. H. "Spectral
Characterizations of Some Distance-Regular Graphs." J. Algebraic Combin. 15,
189-202, 2003.
Weisstein, Eric W. "Local McLaughlin Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LocalMcLaughlinGraph.html
