Connectivity and superconnectivity of large graphs and digraphs. (English) Zbl 0708.05034
Let be G a digraph with diameter D. For a given integer \(\pi\), \(0\leq \pi \leq 0\) minimum degree -2, \(\ell_{\pi}\), \(1\leq \ell_{\geq}\leq D\), is denoted as the greatest integer such that for any two vertices x, y holds: there is only one shortest path from x to y and there are at most \(\pi\) different paths from x to y of length \(d(x,y)+1\) if the distance d(x,y) of x and y is less than \(\ell_{\pi}.\)
Here the author gives some graphical expressions involving several graph numbers and this new definition.
Here the author gives some graphical expressions involving several graph numbers and this new definition.
Reviewer: M.Hager