✦ LIBER ✦

Estimates of the spectral radius of graphs *

✍ Scribed by Friedland, Shmuel

Book ID: 127167773
Publisher: Taylor and Francis Group
Year: 1993
Tongue: English
Weight: 277 KB
Volume: 34
Category: Article
ISSN: 0308-1087
DOI: 10.1080/03081089308818206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the spectral radius of graphs

✍ Aimei Yu; Mei Lu; Feng Tian 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The spectral radius of irregular graphs

✍ Lingsheng Shi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Let λ 1 be the largest eigenvalue and λ n the least eigenvalue of the adjacency matrix of a connected graph G of order n. We prove that if G is irregular with diameter D, maximum degree Δ, minimum degree δ and average degree d, then . The inequality improves previous bounds of various authors and

The Spectral Radius of infinite Graphs

✍ Biggs, N. L.; Mohar, B.; Shawe-Taylor, J. 📂 Article 📅 1988 🏛 Oxford University Press 🌐 English ⚖ 100 KB

Walks and the spectral radius of graphs

✍ Vladimir Nikiforov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 161 KB

The Laplacian spectral radius of some gr

The Laplacian spectral radius of some graphs

✍ Jianxi Li; Wai Chee Shiu; Wai Hong Chan 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 178 KB

The Spectral Radius of Graphs on Surface

The Spectral Radius of Graphs on Surfaces

✍ M.N. Ellingham; Xiaoya Zha 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 152 KB

This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th