Graphs with three eigenvalues and second largest eigenvalue at most 1
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.
Saved in:
Main Authors: | Cheng, Xi-Ming, Greaves, Gary Royden Watson, Koolen, Jack H. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/144948 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On a lower bound for the Laplacian eigenvalues of a graph
by: Greaves, Gary Royden Watson, et al.
Published: (2020) -
Edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2019) -
Eigenvalues of the derangement graph
by: Ku, C.Y., et al.
Published: (2014) -
Another construction of edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2020) -
Strong semismoothness of eigenvalues of symmetric matrices and its application to inverse eigenvalue problems
by: Sun, D., et al.
Published: (2013)