𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for λ′-optimality in graphs of diameter 2

✍ Scribed by Angelika Hellwig; Lutz Volkmann

Book ID
108113419
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
236 KB
Volume
283
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient conditions for λ′-optimality
Sufficient conditions for λ′-optimality in graphs with girth g
✍ C. Balbuena; P. García-Vázquez; X. Marcote 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB

## Abstract For a connected graph the restricted edge‐connectivity λ′(__G__) is defined as the minimum cardinality of an edge‐cut over all edge‐cuts __S__ such that there are no isolated vertices in __G__–__S__. A graph __G__ is said to be λ′‐optimal if λ′(__G__) = ξ(__G__), where ξ(__G__) is the m

Sufficient conditions for graphs to be λ
Sufficient conditions for graphs to be λ′-optimal, super-edge-connected, and maximally edge-connected
✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

## Abstract The restricted‐edge‐connectivity of a graph __G__, denoted by λ′(__G__), is defined as the minimum cardinality over all edge‐cuts __S__ of __G__, where __G__‐__S__ contains no isolated vertices. The graph __G__ is called λ′‐optimal, if λ′(__G__) = ξ(__G__), where ξ(__G__) is the minimum