Restricted Arc-Connectivity of Digraphs

Abstract

Let \(D = (V, A)\) be a strongly connected digraph. \(D\) is called \(\lambda’\)-optimal if its restricted arc-connectivity equals the minimum arc degree. In this paper, we provide sufficient conditions for digraphs to be \(\lambda’\)-optimal.