The bipanconnectivity of bipartite hypercube-like networks

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 B'(n). We show that for any n-dimensional bipartite hypercube-like network G is an element of B'(n) with f faulty elements (edges and/or vertices), including f(v) 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 1 linking them, where 2n - 4 <= l <= 2(n) - 2f(v) - 1 and l- d 0 (mod 2). Our result is optimal when considering the number of faulty elements. (C) 2020 Elsevier Inc. All rights reserved.

Automated summary

The paper studies the fault-tolerant bipanconnectivity of bipartite n-dimensional hypercube-like networks and presents optimal results in terms of the number of faulty elements.