✦ LIBER ✦

A lower bound on the spectral radius of the universal cover of a graph

✍ Scribed by Shlomo Hoory

Book ID: 108167369
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 236 KB
Volume: 93
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.06.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound on the spectral radius of graphs

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

Sharp upper and lower bounds for the Lap

Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs

✍ Ji-ming Guo 📂 Article 📅 2008 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 153 KB

Bounds on the (Laplacian) spectral radiu

Bounds on the (Laplacian) spectral radius of graphs

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

A bound on the spectral radius of graphs

A bound on the spectral radius of graphs with e edges

✍ Richard P. Stanley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Sharp upper bounds on the distance spect

Sharp upper bounds on the distance spectral radius of a graph

✍ Chen, Yingying; Lin, Huiqiu; Shu, Jinlong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Lower bounds for the spectral radius of

Lower bounds for the spectral radius of a matrix

✍ Bill G. Horne 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 444 KB

We develop lower bounds for the spectral radius of symmetric, skew-symmetric, and arbitrary real matrices, Our approach utilizes the well-known Leverrier-Faddeev algorithm for calculating the coefficients of the characteristic polynomial of a matrix in conjunction with a theorem by Lucas which state