The bipanconnectivity of bipartite hypercube-like networks

Highlights：

• We would like to submit the following manuscript for possible evaluation.

• Bipanconnectivity is an important parameter in bipartite networks related on the embedding problem of linear arrays and rings. In this paper, we study the fault-tolerant bipanconnectivity of bipartite n-dimensional hypercube-like networks, denoted as Bn′. We show that for any n-dimensional bipartite hypercube-like network G∈Bn′ with f faulty elements (edges and/or vertices), including fv faulty vertices such that f≤n−2, for each pair of fault-free vertices of distance d in G, there exists a fault-free path of length l linking them, where 2n−4≤l≤2n−2fv−1 and l−d≡0 (mod 2). Our result is optimal when considering the number of faulty elements.

摘要

•We would like to submit the following manuscript for possible evaluation.•Bipanconnectivity is an important parameter in bipartite networks related on the embedding problem of linear arrays and rings. In this paper, we study the fault-tolerant bipanconnectivity of bipartite n-dimensional hypercube-like networks, denoted as Bn′. We show that for any n-dimensional bipartite hypercube-like network G∈Bn′ with f faulty elements (edges and/or vertices), including fv faulty vertices such that f≤n−2, for each pair of fault-free vertices of distance d in G, there exists a fault-free path of length l linking them, where 2n−4≤l≤2n−2fv−1 and l−d≡0 (mod 2). Our result is optimal when considering the number of faulty elements.

论文评审过程：Received 30 January 2020, Revised 10 July 2020, Accepted 19 July 2020, Available online 17 September 2020, Version of Record 17 September 2020.