Local-edge-connectivity in digraphs and oriented graphs (Q2463907): Difference between revisions

The local-edge-connectivity \(\lambda(u,v)\) of two vertices \(u\) and \(v\) in a digraph \(D\) is the maximum number of edge-disjoint \(u\)-\(v\) paths in \(D\). A digraph \(D\) is said to be maximally local-edge-connected when for all pairs \(u\) and \(v\) of vertices \(\lambda(u,v)\) equals the minimum of out-degree of \(u\) and in-degree of \(v\). Some known sufficient conditions guaranteeing equality of edge-connectivity and minimum degree of an oriented graph (i.e. a digraph without 2-cycles) are shown to guarantee the maximal local-edge-connectivity too. Moreover, the validity of a result for digraphs of diameter at most three [\textit{J. Fabrega} and \textit{M. A. Fiol}, Discrete Appl. Math. 69, 271--279 (1996; Zbl 0857.05063)] is discussed for the local property.