✦ LIBER ✦

Bounds on graph eigenvalues I

✍ Scribed by Vladimir Nikiforov

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 115 KB
Volume: 420
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.08.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on graph eigenvalues II

✍ Vladimir Nikiforov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We prove three results about the spectral radius μ(G) of a graph G: (b) For most irregular graphs G of order n and size m,

On upper bounds for Laplacian graph eige

On upper bounds for Laplacian graph eigenvalues

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

Bounds of eigenvalues of graphs

✍ Yuan Hong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents an algebraically defined invariant system of a graph. We get some bounds of the eigenvalues of graphs and propose a few open problems.

Bounds on graph spectra

✍ R.C Brigham; R.D Dutton 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Bounds on eigenvalues of finite element

Bounds on eigenvalues of finite element systems

✍ Jerry I. Lin 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Bounds on eigenvalues and chromatic numb

Bounds on eigenvalues and chromatic numbers

✍ Dasong Cao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 455 KB

We give new bounds on eigenvalue of graphs which imply some known bounds. In particular, if T(G) is the maximum sum of degrees of vertices a~t to a vertex in a graph G, the largest eigenvalue p(G) of G satisfies p(G) <~ ~IT(G) with equality if and only if either G is regular or G is bipartite and su