The panpositionable panconnectedness of crossed cubes

Abstract

In many parallel and distributed multiprocessor systems, the processors are connected based on different types of interconnection networks. The topological structure of an interconnection network is typically modeled as a graph. Among the many kinds of network topologies, the crossed cube is one of the most popular. In this paper, we investigate the panpositionable panconnectedness problem with respect to the crossed cube. A graph G is r-panpositionably panconnected if for any three distinct vertices x, y, z of G and for any integer $l_1$ satisfying $r \le l_1 \le |V(G)| - r - 1$, there exists a path $P = [x, P_1, y, P_2, z]$ in G such that (i) $P_1$ joins x and y with $l(P_1) = l_1$ and (ii) $P_2$ joins y and z with $l(P_2) = l_2$ for any integer $l_2$ satisfying $r \le l_2 \le |V(G)| - l_1 - 1$, where |V(G)| is the total number of vertices in G and $l(P_1)$ (respectively, $l(P_2)$) is the length of path $P_1$ (respectively, $P_2$). By mathematical induction, we demonstrate that the n-dimensional crossed cube $CQ_n$ is n-panpositionably panconnected. This result indicates that the path embedding of joining x and z with a mediate vertex y in $CQ_n$ is extremely flexible. Moreover, applying our result, crossed cube problems such as panpositionable pancyclicity, panpositionably Hamiltonian connectedness, and panpositionable Hamiltonicity can be solved.