Generalized measures of fault tolerance for bubble sort networks

Xiang-Jun Li, Xue-Qian Zeng and Jun-Ming Xu

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

Abstract: The κk and λk are two generalized measurements for fault tolerance of large-scale processing system. For the bubble sort networks Bn, this paper determines κk(Bn)=λk(Bn)=2k(n−k−1) for k ≤ n/2. The results show that to disconnect Bn with each vertex in resulting graph has at least k fault-free neighbors, at least 2k(n−k−1) faulty vertices or faulty edges have to occur. In particular, the results also settle affirmatively a conjecture proposed by Shi and Wu (Acta Math. Appl. Sin-E., 33 (4)(2017), 933–944).

Keywords: Interconnection networks; Fault tolerance; k-connectivity; Bubble sort graphs (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319306228
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:363:y:2019:i:c:29

DOI: 10.1016/j.amc.2019.124630

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 ().