Upper bound for the Laplacian graph eigenvalues
type: Item
instance of: scholarly article
title: Upper bound for the Laplacian graph eigenvalues
zbMATH Open document ID: 1074.15026
publication date: 2005-06-07T00:00:00Z
review text: The authors present two new upper bounds for the largest Laplacian eigenvalue of a connected graph, in terms of the largest and smallest degrees, and the numbers of vertices and edges of the graph. They also determine the extremal graphs which achieve the upper bounds.
Mathematics Subject Classification ID: 15A42
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15B57
zbMATH DE Number: 2174193
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: Largest eigenvalue
zbMATH Keywords: upper bound
zbMATH Keywords: connected graph
zbMATH Keywords: extremal graphs
author: Jiongsheng Li
author: Yongliang Pan
reviewed by: C. M.da Fonseca
MaRDI profile type: Publication
full work available at URL: s10114-004-0332-4
OpenAlex ID: W2078907300
cites work: Laplacian matrices of graphs: A survey
cites work: Q4873761
cites work: Q4352274
cites work: The Laplacian Spectrum of a Graph II
cites work: A note on the second largest eigenvalue of the laplacian matrix of a graph∗
cites work: Eigenvalues of the Laplacian of a graph∗
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: Matrix Analysis
DOI: 10.1007/S10114-004-0332-4
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 2174193