Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size |
| |
Authors: | Milz Sebastian Volkmann Lutz |
| |
Institution: | Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany |
| |
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. |
| |
Keywords: | Digraphs edge-connectivity maximally edge-connected digraphs super-edge-connected digraphs |
本文献已被 SpringerLink 等数据库收录! |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 |
| 点击此处可从《数学学报(英文版)》下载免费的PDF全文 |