✦ LIBER ✦

Algebraic connectivity on a subclass of caterpillars

✍ Scribed by Oscar Rojo; Israel Rocha; Vilmar Trevisan

Book ID: 108120810
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 185 KB
Volume: 37
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.05.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing the algebraic connectivity fo

Maximizing the algebraic connectivity for a subclass of caterpillars

✍ Oscar Rojo; Luis Medina; Nair Abreu; Claudia Justel 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 199 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

On a bound on algebraic connectivity: th

On a bound on algebraic connectivity: the case of equality

✍ Stephen J. Kirkland; Michael Neumann; Bryan L. Shader 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 474 KB

Conjectures on index and algebraic conne

Conjectures on index and algebraic connectivity of graphs

✍ Kinkar Ch. Das 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Algebraic independence of values of a su

Algebraic independence of values of a subclass of entire functions

✍ V. A. Kulagin 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 315 KB

On the algebraic connectivity of graphs

On the algebraic connectivity of graphs as a function of genus

✍ Jason J. Molitierno 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing that for fixed k 1, the graph of genus k of largest algebraic connectivity is a complete graph. We then find an upper bound for noncomplete graphs of a fixed genus k 1 and we determine the values of