The generalized connectivity of $(n,k)$-bubble-sort graphs

Shu-Li Zhao, Rong-Xia Hao, Lidong Wu

Let $S\subseteq V(G)$ and ${\kappa }_G(S)$ denote the maximum number $r$ of edge-disjoint trees $T_1,T_2,\cdots ,T_r$ in $G$ such that $V(T_i)\bigcap V(T_j)=S$ for any $i, j \in \{1,…