Onk-Maximal Strength Digraphs
Janet Anderson, Hong‐Jian Lai, Xiaoxia Lin, Murong Xu · Journal of Graph Theory · 2015
Let be an integer and let D be a simple digraph on vertices. We prove that If then D must have a nontrivial subdigraph H such that the strong arc connectivity of H is at least . We also show that this bound is best possible and present a constructive characterization for the extremal graphs.