 Local connectivity

For nonadjacent vertices $a,b$ of a graph $G$, their local connectivity $\kappa (a,b;G)$ is the minimum size of an $a$-$b$ vertex separator. By the Menger theorem, it also equals the maximum number of internally vertex-disjoint $a$-$b$ paths.