Improved Bounds for the Extremal Non-Trivial Laplacian Eigenvalues
Pages : 65-68
View : 15 | Download : 7
Publication Date : 2015-02-23
Article Type : Research Paper
Abstract :Let G be a simple connected graph and its Laplacian eigenvalues be µ1≥ µ2≥…≥ µn-1≥ µn=0. In this paper, we present an upper bound for the algebraic connectivity µn-1 of G and a lower bound for the largest eigenvalue µ1 of G in terms of the degree sequence d1,d2,…,dn of G and the number Ni∩Nj of common vertices of i and j insert ignore into journalissuearticles values(1≤i
Keywords : Laplacian eigenvalues, upper bounds, lower bounds, eigenvalue inequalities
