✦ LIBER ✦

Sharp upper bounds on the spectral radius of graphs

✍ Scribed by Jinlong Shu; Yarong Wu

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 176 KB
Volume: 377
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.07.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Sharp Upper Bound of the Spectral Radi

A Sharp Upper Bound of the Spectral Radius of Graphs

✍ Yuan Hong; Jin-Long Shu; Kunfu Fang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

New upper bounds on the spectral radius

New upper bounds on the spectral radius of unicyclic graphs

✍ Oscar Rojo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Sharp bounds on the distance spectral ra

Sharp bounds on the distance spectral radius and the distance energy of graphs

✍ G. Indulal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Bounds on the (Laplacian) spectral radiu

Bounds on the (Laplacian) spectral radius of graphs

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

Upper bounds on the spectral radius of b

Upper bounds on the spectral radius of book-free and/or -free graphs

✍ Lingsheng Shi; Zhipeng Song 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Upper Bounds of the Spectral Radius of G

Upper Bounds of the Spectral Radius of Graphs in Terms of Genus

✍ Hong Yuan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let G be a simple graph with n vertices and orientable genus g and non-orientable genus h. Let \(G) be the spectral radius of the adjacency matrix A of G. We obtain the following sharp bounds of \(G): (1) \(G) 1+-3n+12g&8; (2) \(G) 1+-3n+6h&8.