We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size.
- Authors
Milz, Sebastian; Volkmann, Lutz
- Abstract
Let D be a finite and simple digraph with vertex set V(D). The minimum degree δ of a digraph D is defined as the minimum value of its out-degrees and its in-degrees. If D is a digraph with minimum degree δ and edge-connectivity λ, then λ ≤ δ. A digraph is maximally edge-connected if λ = δ. A digraph is called super-edge-connected if every minimum edge-cut consists of edges incident to or from a vertex of minimum degree. In this note we show that a digraph is maximally edge-connected or super-edge-connected if the number of arcs is large enough.
- Publication
Acta Mathematica Sinica, 2019, Vol 35, Issue 12, p1861
- ISSN
1439-8516
- Publication type
Academic Journal
- DOI
10.1007/s10114-019-8448-8