Lower bounds of the Laplacian spectrum of graphs based on diameter

19Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

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. © 2006 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Lu, M., Zhang, L. zhu, & Tian, F. (2007). Lower bounds of the Laplacian spectrum of graphs based on diameter. Linear Algebra and Its Applications, 420(2–3), 400–406. https://doi.org/10.1016/j.laa.2006.07.023

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free