✦ LIBER ✦

On a bound on algebraic connectivity: the case of equality

✍ Scribed by Stephen J. Kirkland; Michael Neumann; Bryan L. Shader

Book ID: 110419677
Publisher: Springer
Year: 1998
Tongue: English
Weight: 474 KB
Volume: 48
Category: Article
ISSN: 0011-4642
DOI: 10.1023/a:1022415527627

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sharp upper bound on algebraic connect

A sharp upper bound on algebraic connectivity using domination number

✍ M. Aouchiche; P. Hansen; D. Stevanović 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 760 KB

Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the

Tight bounds on the algebraic connectivi

Tight bounds on the algebraic connectivity of Bethe trees

✍ Oscar Rojo; Luis Medina 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Algebraic connectivity on a subclass of

Algebraic connectivity on a subclass of caterpillars

✍ Oscar Rojo; Israel Rocha; Vilmar Trevisan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 185 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

On the algebraic connectivity of some ca

On the algebraic connectivity of some caterpillars: A sharp upper bound and a total ordering

✍ Oscar Rojo; Luis Medina; Nair Abreu; Claudia Justel 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 231 KB

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