3-path-connectivity of bubble-sort star graphs

Abstract

Let $G$ be a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. Let $T$ be a subset of $ V(G)$ with cardinality $|T|\geq2$. A path connecting all vertices of $T$ is called a $T$-path of $G$. Two $T$-paths $P_i$ and $P_j$ are said to be internally disjoint if $V(P_i)\cap V(P_j)=T$ and $E(P_i)\cap E(P_j)=\emptyset$. Denote by $π_G(T)$ the maximum number of internally disjoint $T$- paths in G. Then for an integer $\ell$ with $\ell\geq2$, the $\ell$-path-connectivity $π_\ell(G)$ of $G$ is formulated as $\min\{π_G(T)\,|\,T\subseteq V(G)$ and $|T|=\ell\}$. In this paper, we study the $3$-path-connectivity of $n$-dimensional bubble-sort star graph $BS_n$. By deeply analyzing the structure of $BS_n$, we show that $π_3(BS_n)=\lfloor\frac{3n}2\rfloor-3$, for any $n\geq3$.