Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825)

Parameters \(k\) and \(\lambda\) are used to measure the connectivity and edge-connectivity, and parameters \(k_1\) and \(\lambda_1\) to measure the superconnectivity and edge-superconnectivity. The authors give a sufficient condition for the superconnectivity of a graph in terms of the diameter of the graph, and they also give a lower bound for the superconnectivity \(k_1\). An analogical sufficient condition and a lower bound are given for the edge-superconnectivity \(\lambda_1\).