𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for graphs to be λ′-optimal and super-λ′

✍ Scribed by Li Shang; Heping Zhang

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
200 KB
Volume
49
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 a graph to be
Sufficient conditions for a graph to be super restricted edge-connected
✍ Shiying Wang; Shangwei Lin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. A restricted edge cut __F__ of a connected graph __G__ is an edge cut such that __G__‐__F__ has no isolated vertex. The restricted edge connectivity λ′ is the minimum cardinality over all re

A sufficient condition for bipartite gra
A sufficient condition for bipartite graphs to be type one
✍ Xu, Baogang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.

Neighborhood conditions for graphs to be
Neighborhood conditions for graphs to be super restricted edge connected
✍ Shiying Wang; Jing Li; Lihong Wu; Shangwei Lin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

## Abstract Restricted edge connectivity is a more refined network reliability index than edge connectivity. For a connected graph __G__ = (__V__, __E__), an edge set __S__ ⊆ __E__ is a restricted edge cut if __G__ − __S__ is disconnected and every component of __G__ − __S__ has at least two vertic