Maden, A. DilekBuyukkose, Serife2020-03-262020-03-2620121331-4343https://dx.doi.org/10.7153/mia-15-46https://hdl.handle.net/20.500.12395/27799Let G be a connected simple graph whose Laplacian eigenvalues are 0 = mu(n) (G) <= mu(n-1) (G) <= ... <= mu(1) (G). In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G.en10.7153/mia-15-46info:eu-repo/semantics/openAccessalgebraic connectivityLaplacian eigenvaluestraceArticle153529536Q2WOS:000306591100004Q2