Let \(j_1,j_2\) be integers with \( j_2\geqslant j_1\) . For any integer x with \(j_2\geqslant x\geqslant j_1\) , if a simple connected graph G contains two cycles C and \(C^*\) with \(|V(C)|=x\) and \(V(C^*)=V(G)-V(C)\) , then G is two-disjoint-cycle-cover \([j_1,j_2]\) -pancyclic or briefly 2-DCC \([j_1,j_2]\) -pancyclic. For any \(a,b\in V(G)\) with \(a\ne b\) , the graph G is 2-DCC vertex \([j_1,j_2]\) -pancyclic if it contains cycles \(C,C^*,C_1,C_1^*\) satisfying \(a\in V(C)\cap V(C_1)\) and \(b\in V(C^*)\cap V(C_1^*)\) , where x is an arbitrary integer with \(j_2\geqslant x\geqslant j_1\) and \(|V(C)|=x\) , \(|V(C_1)|=|V(G)|-x\) , \(V(C^*)=V(G)-V(C)\) , \(V(C_1^*)=V(G)-V(C_1)\) . We study the 2-DCC pancyclicity of (n, k)-bubble-sort network \(B_{n,k}\) in this paper. We obtain that (1) For \(n\geqslant 6\) , the \(B_{n,1}\) is 2-DCC vertex \([3,\lfloor \frac{n}{2}\rfloor ]\) -pancyclic and 2-DCC \([3,\lfloor \frac{n}{2}\rfloor ]\) -pancyclic; (2) For \(n\geqslant 9\) , the \(B_{n,2}\) is 2-DCC vertex \([3, \frac{n(n-1)}{2}]\) -pancyclic and 2-DCC \([3, \frac{n(n-1)}{2}]\) -pancyclic; (3) For \(n\geqslant 9\) with \(n-7\geqslant k \geqslant 2\) , the \(B_{n,k}\) is 2-DCC \([3, \frac{n!}{2(n-k)!}]\) -pancyclic.
