No Access
On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues*
https://doi.org/10.1142/S1005386719000075Cited by:11 (Source: Crossref)
Abstract
We characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues among which one is equal to 1, and determine all connected bipartite graphs with at least one vertex of degree 1 having exactly four distinct normalized Laplacian eigenvalues. In addition, we find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues.
* This work is supported by the National Natural Science Foundation of China (grants No. 11671344, 11531011 and 11701492).
Communicated by Genghua Fan
2010 MSC: 05C50
