✦ LIBER ✦

A sharp upper bound on the incidence energy of graphs in terms of connectivity

✍ Scribed by Oscar Rojo; Eber Lenes

Book ID: 118138660
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 252 KB
Volume: 438
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.09.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharp upper bounds on the second largest

Sharp upper bounds on the second largest eigenvalues of connected graphs

✍ Mingqing Zhai; Huiqiu Lin; Bing Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 280 KB

A sharp upper bound for the rainbow 2-co

A sharp upper bound for the rainbow 2-connection number of a 2-connected graph

✍ Li, Xueliang; Liu, Sujuan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Sharp upper bounds on the spectral radiu

Sharp upper bounds on the spectral radius of graphs

✍ Jinlong Shu; Yarong Wu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 176 KB

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

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

A sharp upper bound on the largest Lapla

A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

✍ Kinkar Ch. Das; R.B. Bapat 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and