Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks

Liqiong Xu

Applied Mathematics and Computation, 2024, vol. 473, issue C

Abstract: Analysis on the link fault tolerability of multiprocessor systems plays a significance role in designing and optimizing for multiprocessor systems. The component edge-connectivity, as a generalization of the classical edge-connectivity, is a considerable measurement for the analysis of the robustness of multiprocessor systems. The k-component edge-connectivity of a connected graph G, expressed by cλk(G), is the minimum cardinality of an edge set whose removal is disconnected and has at least k components in the resulting graph. The n-th cartesian product of the Petersen graph P, called as the n-dimensional folded Petersen network Pn, is one of the most appealing topologies for multiprocessor systems. In this paper, cλk(Pn) for 1≤k≤2n−1 are obtained.

Keywords: Component edge-connectivity; Fault tolerability; Folded Petersen network; Interconnection networks (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001450
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:473:y:2024:i:c:s0096300324001450

DOI: 10.1016/j.amc.2024.128673

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