𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of minimally -connected graphs

✍ Scribed by Xiaofeng Gu; Hong-Jian Lai; Senmei Yao

Book ID
113663256
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
189 KB
Volume
111
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimally 3-connected graphs
Minimally 3-connected graphs
✍ Robin W Dawes πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 489 KB
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
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
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
MINIMALLY 2-EDGE-CONNECTED GRAPHS
✍ Stephen B. Maurer; Peter J. Slater πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 309 KB