The super spanning connectivity of arrangement graph

Pingshan Li, Min Xu

A $k$-container $C(u,v)$ of a graph $G$ is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u,v)$ of $G$ is a $k^{\ast }$-container if it is a spanning su…