On the Laplacian spectral radius of a tree.
type: Item
instance of: scholarly article
title: On the Laplacian spectral radius of a tree.
zbMATH Open document ID: 1036.05030
DOI: 10.1016/S0024-3795(02)00716-4
author: Jiming Guo
published in: Linear Algebra and its Applications
publication date: 2003-07-30T00:00:00Z
review text: The Laplacian matrix of a graph is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. The Laplacian spectral radius of a graph is the largest eigenvalue of its Laplacian matrix. This paper gives upper bounds on the Laplacian spectral radius of trees, in terms of the size of a maximum matching in it, and the number of vertices. In several cases, it is shown that the bounds are sharp.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1956813
zbMATH Keywords: matching number
zbMATH Keywords: retraction
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: eigenvalue
reviewed by: Hans L. Bodlaender
MaRDI profile type: Publication
cites work: Eigenvalues of the Laplacian of a graph∗
cites work: The Laplacian Spectrum of a Graph
cites work: Ordering trees by algebraic connectivity
cites work: A new upper bound for eigenvalues of the Laplacian matrix of a graph
cites work: On the Laplacian eigenvalues of a graph
cites work: A note on Laplacian graph eigenvalues
cites work: Laplacian matrices of graphs: A survey
cites work: An always nontrivial upper bound for Laplacian graph eigenvalues
description: scientific article; zbMATH DE number 1956813