𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super Restricted Edge Connectivity of Regular Graphs

✍ Scribed by Ou Jianping; Fuji Zhang

Publisher
Springer Japan
Year
2005
Tongue
English
Weight
244 KB
Volume
21
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 47 KB πŸ‘ 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Υ… i Υ… 2d Οͺ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Minimally restricted edge connected grap
Minimally restricted edge connected graphs
✍ Yanmei Hong; Qinghai Liu; Zhao Zhang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 176 KB

For a connected graph G = (V, E), an edge set S βŠ‚ E is a restricted edge cut if G -S is disconnected and there is no isolated vertex in G -S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by Ξ» (G). , where ΞΎ(G) is the minimum edge degree of