Degree and local connectivity in digraphs |
| |
| Authors: | W. Mader |
| |
| Affiliation: | 1. Institut für Mathematik, Universit?t Hannover, Welfengarten 1, D 3, Hannover 1, Germany
|
| |
| Abstract: | ![]()
It is shown that there is a digraphD of minimum outdegree 12m and  μ(x, y; D)=11m, but every digraphD of minimum outdegreen contains verticesx ≠y withλ(x, y; D)≧n−1, whereμ(x, y; D) andλ(x, y; D) denote the maximum number of openly disjoint and edge-disjoint paths, respectively. |
| |
| Keywords: | 05 C 40 05 C 20 05 C 38 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
