Restricted Arc-Connectivity of Digraphs

Litao Guo1,2, Xiaofeng Guo2
1School of Applied Mathematics, Xiamen University of Technology, Xiamen Fujian 361024, China
2School of Mathematical Sciences, Xiamen University, Xiamen Fujian 361005, China

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.