Vertex-independent spanning trees in complete Josephus cubes

Abstract

Vertex-independent spanning trees (short for VISTs) serve as pivotal constructs in numerous network algorithms and have been the subject of extensive research for three decades. The n-dimensional complete Josephus cube $CJ{C}_n$, derived from the Josephus cube, was first proposed to achieve better fault tolerance while maximizing routing efficiency (no sacrificing routing efficiency). Compared to the Josephus cube, it exhibits enhanced symmetry, improved connectivity, and better fault tolerance while maintaining efficient embedding, incremental scalability, and short diameter ($\lceil \frac{n}{2}\rceil$). This paper studies the existence and construction of $n+2$ VISTs in $CJ{C}_n$ rooted at an arbitrary vertex. To determine the specific connection edge between vertex v and its parent in the spanning tree $T_i$, three algorithms were first proposed to calculate the values of $F_{v,i}$, $M_{v,i}$, and $H_{v,i}$, respectively, where $v\in V\left(CJ{C}_n\right)$ and $i\in \{0,1,\cdots ,n+1\}$. Based on these algorithms, a parallel algorithm is proposed to construct $n+2$ ($n\ge 4$) VISTs in $CJ{C}_n$ using $2^n$ processors. As $CJ{C}_n$ is $(n+2)$-connected, our algorithm is designed to yield the optimal number of resulting VISTs for $n\ge 4$. Finally, we present the theoretical proof of the parallel algorithm and demonstrate that its time complexity is $O\left(n\right)$.