1 research outputs found
On the second smallest and the largest normalized Laplacian eigenvalues of a graph
Let be a simple connected graph with order . Let be
the normalized Laplacian matrix of . Let be the -th
smallest normalized Laplacian eigenvalue of . Denote the spectral
radius of the matrix . In this paper, we study the behaviors of
and when the graph is perturbed by
three operations.Comment: 14 pages, 3 figure