✦ LIBER ✦

Tight bounds on the algebraic connectivity of Bethe trees

✍ Scribed by Oscar Rojo; Luis Medina

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 190 KB
Volume: 418
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.03.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing tight upper bounds on the alge

Computing tight upper bounds on the algebraic connectivity of certain graphs

✍ Oscar Rojo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Improved bounds for the Laplacian energy

Improved bounds for the Laplacian energy of Bethe trees

✍ Marı´a Robbiano; Raúl Jiménez 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 147 KB

The ordering of trees and connected grap

The ordering of trees and connected graphs by algebraic connectivity

✍ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with α(P n ) < α(Q n ) < α(W n ) < α(Z n ) < α(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views

An explicit formula for eigenvalues of B

An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree

✍ Oscar Rojo; María Robbiano 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A lower bound for algebraic connectivity

A lower bound for algebraic connectivity based on the connection-graph-stability method

✍ Ali Ajdari Rad; Mahdi Jalili; Martin Hasler 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 323 KB