On graphs with three or four distinct normalized Laplacian eigenvalues
classification
🧮 math.CO
keywords
distincteigenvaluesgraphslaplaciannormalizedfourthreeconnected
read the original abstract
In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly four distinct normalized Laplacian eigenvalues, and find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues.
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.