The bipanconnectivity of bipartite hypercube-like networks

Ruichao Niu and Min Xu

Applied Mathematics and Computation, 2021, vol. 389, issue C

Abstract: 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.

Keywords: Bipanconnectivity; Bipancyclicity; Bipartite hypercube-like networks; Faulty elements (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320305208
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:389:y:2021:i:c:s0096300320305208

DOI: 10.1016/j.amc.2020.125564

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().