Cartesian product digraphs with optimal restricted arc connectivity

The restricted arc connectivity of digraphs is a generalization of arc connectivity. In 2009, Chen and Liu [2] showed an upper bound on the restricted arc connectivity for Cartesian product digraphs. In this paper, we present a sufficient condition for this upper bound to be attained. Furthermore, we give an example to show that our result is best possible.