On restricted arc-connectivity of regular digraphs (Q2493638)

The restricted arc-connectivity \(\lambda'\) of a strongly connected digraph \(G\) is the minimum cardinality of an arc cut \(F\) in \(G\) such that every strongly connected component of \(G-F\) contains at least two vertices. The authors prove that for a \(d\)-regular strongly connected digraph with order \(n\) and diameter \(k\), if \(\lambda'\) exists then \(\lambda'(G)\geq \min\left\{{(n-d^{k-1})(d-1)\over d^{k-1}+ d-2}, 2d-2\right\}\) for \(k\neq 3\) and \(\lambda'(6)\geq \min\left\{{n\over 2d+2},2d-2\right\}\) for \(k= 3\). As consequences the restricted arc-connectivity of the de Bruijn and Kautz digraphs and the generalized de Bruijn and Kautz digraphs are determined.