Graphs with three eigenvalues and second largest eigenvalue at most 1
classification
🧮 math.CO
keywords
eigenvalueeigenvaluesgraphslargestsecondthreeclassifyconnected
read the original abstract
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.