Local-edge-connectivity in digraphs and oriented graphs |
| |
Authors: | Lutz Volkmann |
| |
Institution: | Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany |
| |
Abstract: | A digraph without any cycle of length two is called an oriented graph. The local-edge-connectivityλ(u,v) of two vertices u and v in a digraph or graph D is the maximum number of edge-disjoint u-v paths in D, and the edge-connectivity of D is defined as . Clearly, λ(u,v)?min{d+(u),d-(v)} for all pairs u and v of vertices in D. Let δ(D) be the minimum degree of D. We call a graph or digraph D maximally edge-connected when λ(D)=δ(D) and maximally local-edge-connected when λ(u,v)=min{d+(u),d-(v)} |
| |
Keywords: | 05C40 |
本文献已被 ScienceDirect 等数据库收录! |
|