Das, Kinkar Ch.Gungor, A. DilekBozkurt, S. Burcu2020-03-262020-03-2620150381-7032https://hdl.handle.net/20.500.12395/32389Let G = (V, E) be a simple connected graph with n vertices and m edges. Further let lambda(i)(L), i = 1, 2, ..., n, be the non-increasing eigenvalues of the normalized Laplacian matrix of the graph G. In this paper, we obtain the following result: For a connected graph G of order n, lambda(2)(L) = lambda(3)(L) = ... = lambda(n-1)(L) if and only if G is a complete graph K-n or G is a complete bipartite graph K-p,K- q. Moreover, we present lower and upper bounds for the normalized Laplacian spectral radius of a graph and characterize graphs for which the lower or upper bounds is attained.eninfo:eu-repo/semantics/closedAccessGraphnormalized Laplacian eigenvaluesboundArticle118143154Q4WOS:000351784600012Q4