Diameter, short paths and superconnectivity in digraphs (Q704288)

The \(\pi\)-semigirth \(\ell^\pi\) of a graph \(G\) with diameter \(D\) and minimum degree \(\delta\) is defined as the greatest integer \(1\leq \rho^\pi\leq D\) such that for any two vertices \(u, v\) holds: if \(d(u,v) <\ell^\pi\), the shortest \(u\to v\) path is unique and there are at most \(\pi\) paths \(u\to v\) of length \(d(u,v)+1\); if \(d(u,v)=\ell^\pi\) there is only one shortest \(u\to v\) path. This is a generalization of the semigirth \(\ell^0\) introduced by \textit{J. Fàbrega} and \textit{M. A. Fiol} [J. Graph Theory 13, 657--668 (1989; Zbl 0688.05029)]. A connected digraph is called superconnected if and only if it is maximally connected and every minimum disconnecting set \(F\) consists of the vertices adjacent to (or from) a given vertex not in \(F\). The main result given in this article is: Let be \(G\) be a digraph with minimum degree \(\delta\geq 3\), diameter \(D\), \(\pi\)-semigirths \(\ell\geq 2\) and \(\ell^\pi\), \(1\leq \pi\leq \lfloor \delta/2\rfloor\). If \(D\leq 2\ell^\pi-2\), \(\delta\geq 5\) and \(\pi\leq \lfloor (\delta-2)/2\rfloor\), then \(G\) is superconnected. For either \(\alpha\geq 7\) or \(\delta\leq 6\) and \(\pi\leq \lfloor \delta-1)/2\rfloor\), \(\delta\) equals the connectivity of \(G\), if \(D\leq 2\ell^\pi-2\).