✦ LIBER ✦

On k-minimally n-edge-connected graphs

✍ Scribed by Stephen B. Maurer; Peter J. Slater

Book ID: 107748285
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 815 KB
Volume: 24
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90198-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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 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 2-EDGE-CONNECTED GRAPHS

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB