𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimally restricted edge connected graphs

✍ Scribed by Yanmei Hong; Qinghai Liu; Zhao Zhang

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
176 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

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 G. We show in this work that a minimally restricted edge connected graph is always Ξ» -optimal.

πŸ“œ SIMILAR VOLUMES

Minimally 2-edge connected graphs
Minimally 2-edge connected graphs
✍ G. Chaty; M. Chein πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 338 KB

## Abstract A constructive characterization of minimally 2‐edge connected graphs, similar to those of Dirac for minimally 2‐connected graphs is given.

Minimally 4-edge# -connected graphs
Minimally 4-edge# -connected graphs
✍ Bernard Peroche; Christine Virlouvet πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 650 KB

In this article, we deal with a connectivity problem stated by Maurer and Slater to characterize minimally k-edge'-connected graphs. This problem has been solved for k = 1,2 and 3, and we recall herein the results obtained. Then we give some partial results concerning the case k =4: representation o

Minimally (k, k)-edge-connected graphs
Minimally (k, k)-edge-connected graphs
✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 138 KB πŸ‘ 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

On minimally k-edge-connected graphs and
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
✍ Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 170 KB

A graph G = (V; E) is called minimally (k; T )-edge-connected with respect to some T βŠ† V if there exist k-edge-disjoint paths between every pair u; v ∈ T but this property fails by deleting any edge of G. We show that |V | can be bounded by a (linear) function of k and |T | if each vertex in V -T ha