Title of article
Lower bounds of the Laplacian spectrum of graphs based on diameter Original Research Article
Author/Authors
Mei Lu & Mary B. Watson-Manheim، نويسنده , , Lian-zhu Zhang، نويسنده , , Feng Tian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
400
To page
406
Abstract
Let G be a connected graph of order n. The diameter of G is the maximum distance between any two vertices of G. In the paper, we will give some lower bounds for the algebraic connectivity and the Laplacian spectral radius of G in terms of the diameter of G.
Keywords
Laplacian spectral radius , Diameter , Algebraic connectivity
Journal title
Linear Algebra and its Applications
Serial Year
2007
Journal title
Linear Algebra and its Applications
Record number
825421
Link To Document