✦ LIBER ✦

The least eigenvalue of graphs with given connectivity

✍ Scribed by Miao-Lin Ye; Yi-Zheng Fan; Dong Liang

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 131 KB
Volume: 430
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.10.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with given connectivity propertie

Graphs with given connectivity properties

✍ Lawrencenko, Serge; Luo, Qiang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

A node of a graph G, thought of as representing a communication network, is said to be redundant provided that its removal does not diminish the connectivity. In constructing networks, we require reliable connectedness in addition to the usual requirement of reliability (i.e., the higher the connect

Further results on the least eigenvalue

Further results on the least eigenvalue of connected graphs

✍ Miroslav Petrović; Tatjana Aleksić; Slobodan Simić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Graphs with given diameter maximizing th

Graphs with given diameter maximizing the algebraic connectivity

✍ H. Wang; R.E. Kooij; P. Van Mieghem 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 932 KB

Signed graphs with least eigenvalue <−2

✍ N.M. Singhi; G.R. Vijayakumar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Graphs with eigenvalues at least −2

✍ Vijaya Kumar; S.B. Rao; N.M. Singhi 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 776 KB

On connectivity in graphs with given cli

On connectivity in graphs with given clique number

✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 1 views

## Abstract We consider finite, undirected, and simple graphs __G__ of order __n__(__G__) and minimum degree δ(__G__). The connectivity κ(__G__) for a connected graph __G__ is defined as the minimum cardinality over all vertex‐cuts. If κ(__G__) < δ(__G__), then Topp and Volkmann 7 showed in 1993 f