Hardness results on generalized connectivity

Shasha Li, Xueliang Li

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\le k\le n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\el…