✦ LIBER ✦

Optimally reliable graphs for both edge and vertex failures

✍ Scribed by Trefor Evans; Derek Smith

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 331 KB
Volume: 16
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230160208

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On uniformly optimally reliable graphs f

On uniformly optimally reliable graphs for pair-connected reliability with vertex failures

✍ A. T. Amin; K. T. Siegrist; P. J. Slater 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 706 KB

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