Sufficient conditions for super-arc-strongly connected oriented graphs (Q1015435)

A digraph \(D\) is called super-arc-strongly connected if the arcs of every its minimum arc-disconnected set are incident to or from some vertex in \(D\). A digraph without any directed cycle of length 2 is called an oriented graph. Authors prove three sufficient conditions for an oriented graph to be super-arc-strongly connected. Let \(D\) be a strong oriented \(p\)-partite graph \((p\geq 2)\) of order \(n\), minimum out-degree \(\delta^+\) and minimum in-degree \(\delta^-\). If \(\delta^++\delta^-> \frac{(p-1)(n+2)}{2p}\), then \(D\) is super-arc-strongly connected. The second and third sufficient conditions use degree sequence condition of strong oriented graph and minimum restricted arc-degree \(\xi\). These three conditions extend the results of \textit{M. A. Fiol} [J. Graph Theory 16, No. 6, 545--555 (1992; Zbl 0769.05062)].