The superconnectivity of large digraphs and graphs (Q1313826): Difference between revisions

First of all the author gives basic notions and an overview of actual results. The digraph \(D\) is said to be super-\(\kappa\) (vertex connectivity) if all its minimum disconnecting sets are trivial. Analogously, \(D\) is called super-\(\lambda\) (edge connectivity) if all its minimum edge-disconnecting sets are trivial. The author's main results are sufficient conditions for a digraph \(D\) to be super-\(\kappa\) or super-\(\lambda\). Moreover, the author gives several interesting corollaries of these theorems.