| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603780 | Linear Algebra and its Applications | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
