✦ LIBER ✦

Upper Bounds for the Laplacian Graph Eigenvalues

✍ Scribed by Jiong Sheng Li; Yong Liang Pan

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2004
Tongue: English
Weight: 129 KB
Volume: 20
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-004-0332-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Automated conjectures on upper bounds fo

Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs

✍ V. Brankov; P. Hansen; D. Stevanović 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A new upper bound for eigenvalues of the

A new upper bound for eigenvalues of the laplacian matrix of a graph

✍ Li Jiong-Sheng; Zhang Xiao-Dong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.

A characterization on graphs which achie

A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs

✍ Kinkar Ch. Das 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 215 KB

On upper bounds for Laplacian graph eige

On upper bounds for Laplacian graph eigenvalues

✍ Dongmei Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 150 KB

An improved upper bound for Laplacian gr

An improved upper bound for Laplacian graph eigenvalues

✍ Kinkar ch. Das 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 104 KB

Two sharp upper bounds for the Laplacian

Two sharp upper bounds for the Laplacian eigenvalues

✍ Xiao-Dong Zhang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 168 KB

In this paper, we first obtain a sharp upper bound for the eigenvalues of the adjacency matrix of the line graph of a graph. Then this result is used to present a sharp upper bound for the Laplacian eigenvalues. Another sharp upper bound is presented also. Moreover, we determine all extreme graphs w