Sharp lower bounds on the Laplacian eigenvalues of trees
type: Item
instance of: scholarly article
title: Sharp lower bounds on the Laplacian eigenvalues of trees
zbMATH Open document ID: 1047.05027
published in: Linear Algebra and its Applications
publication date: 2004-08-06T00:00:00Z
review text: The author proves sharp lower bounds on the largest and the second largest eigenvalue of the Laplacian matrix of a tree in terms of the vertex degrees and the average degree of neighbors of a vertex and characterizes the cases of equality.
reviewed by: Dragan Stevanović
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 2083498
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: largest eigenvalue
zbMATH Keywords: second largest eigenvalue
zbMATH Keywords: tree
author: Kinkar Ch. Das
MaRDI profile type: Publication
full work available at URL: j.laa.2004.01.012
OpenAlex ID: W2087268502
cites work: An improved upper bound for Laplacian graph eigenvalues
cites work: The Laplacian Spectrum of a Graph II
cites work: On the Laplacian spectral radius of a tree.
cites work: A note on the second largest eigenvalue of the laplacian matrix of a graph∗
cites work: Bounding the largest eigenvalue of trees in terms of the largest vertex degree
DOI: 10.1016/J.LAA.2004.01.012
description: scientific article; zbMATH DE number 2083498