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

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.