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

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 cAk(G), 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 degrees-th cartesian product of the Petersen graph P , called as the degrees-dimensional folded Petersen network P degrees , is one of the most appealing topologies for multiprocessor systems. In this paper, cAk(P degrees) k (P degrees ) for 1 <= k <= 2 degrees - 1 are obtained.