Improved Bounds for the Extremal Non-Trivial Laplacian Eigenvalues
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 (1≤i<j≤n) and hence we improve bounds of Maden and Büyükköse [14].
Keywords
References
- Anderson W.N., Morley T.D., Eigenvalues of the Laplacian of a graph, Linear Multilinear Algebra 18 (1985) 141-145.
- Büyükköse Ş., Bounds for singular values using matrix traces, Msc Thesis, Selçuk University, (2000).
- Chung F.R.K., Eigenvalues of Graphs, In Proceeding of the International Congress of Mathematician, 1333-1342. Switzerland, (1994)
- Das K. Ch., An improved upper bound for Laplacian graph eigenvalues, Linear Algebra Appl. 368 (2003) 269-278.
- Fiedler M., Algebraic connectivity of graphs, Czechoslovak Math. J. 23 (1973) 298-305.
- Li J.-S., Zhang D., A new upper bound for eigenvalues of the Laplacian matrix of a graph, Linear Algebra Appl. 265 (1997) 93-100.
- Li J.-S., Zhang D., On Laplacian eigenvalues of a graph, Linear Algebra Appl. 285 (1998) 305-307.
- Lu M., Zhang L., Tian F., Lower bounds of the Laplacian spectrum of graphs based on diameter, Linear Algebra Appl. 420 (2007) 400-406.
Details
Primary Language
English
Subjects
Engineering
Journal Section
Research Article
Publication Date
February 23, 2015
Submission Date
September 12, 2014
Acceptance Date
-
Published in Issue
Year 2015 Volume: 28 Number: 1