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

TL;DR

This paper determines the generalized 3-connectivity of $(n,k)$-bubble-sort graphs, showing it equals $n-2$ for all relevant $k$, extending known results for the classic bubble-sort graph.

Contribution

It introduces an algorithm to construct internally disjoint paths in $(n,k)$-bubble-sort graphs, establishing the exact value of their generalized 3-connectivity.

Findings

Generalized 3-connectivity of $B_{n,k}$ is $n-2$ for $2 extless k extless n$.

Provides an algorithm for constructing internally disjoint paths in $B_{n-1,k-1}$.

Extends known connectivity results from bubble-sort graphs to $(n,k)$-bubble-sort graphs.

Abstract

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, 2, \cdots, r\}$ and $i\neq j$. For an integer $k$ with $2\leq k\leq n$, the {\em generalized $k$-connectivity} of a graph $G$ is defined as $\kappa_{k}(G)= min\{\kappa_{G}(S)|S\subseteq V(G)$ and $|S|=k\}$. The generalized $k$-connectivity is a generalization of the traditional connectivity. In this paper, the generalized $3$-connectivity of the $(n,k)$-bubble-sort graph $B_{n,k}$ is studied for $2\leq k\leq n-1$. By proposing an algorithm to construct $n-1$ internally disjoint paths in $B_{n-1,k-1}$, we show that $\kappa_{3}(B_{n,k})=n-2$ for $2\leq k\leq n-1$, which generalizes the known result about the bubble-sort graph $B_{n}$ [Applied Mathematics and Computation 274 (2016) 41-46] given by Li $et$ $al.$, as the bubble-sort graph $B_{n}$ is the special $(n,k)$-bubble-sort graph for $k=n-1$.