✦ LIBER ✦

On the spectral radius of quasi-k-cyclic graphs

✍ Scribed by Xianya Geng; Shuchao Li; Slobodan K. Simić

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 353 KB
Volume: 433
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.06.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the spectral radius of quasi-tree gra

On the spectral radius of quasi-tree graphs

✍ Huiqing Liu; Mei Lu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the spectral radius of graphs

✍ Aimei Yu; Mei Lu; Feng Tian 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 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

A bound on the spectral radius of graphs

✍ Hong Yuan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Bounds on the (Laplacian) spectral radiu

Bounds on the (Laplacian) spectral radius of graphs

✍ Lingsheng Shi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 181 KB

The Laplacian spectral radius of graphs

The Laplacian spectral radius of graphs on surfaces

✍ Liang Lin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Let G be an n-vertex (n 3) simple graph embeddable on a surface of Euler genus γ (the number of crosscaps plus twice the number of handles). Denote by the maximum degree of G. In this paper, we first present two upper bounds on the Laplacian spectral radius of G as follows: (i) (ii) If G is 4-conn