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

被引:2
作者
Xu L. [1 ]
机构
[1] School of Science, Jimei University, Fujian, Xiamen
基金
中国国家自然科学基金;
关键词
Component edge-connectivity; Fault tolerability; Folded Petersen network; Interconnection networks;
D O I
10.1016/j.amc.2024.128673
中图分类号
学科分类号
摘要
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. © 2024 Elsevier Inc.
引用
收藏
相关论文
共 25 条
[1]  
Bezrukov S., Das S., Elsasser R., An edge-isoperimetric problem for powers of the Petersen graph, Ann. Comb., 4, pp. 153-169, (2000)
[2]  
Bondy J.A., Murty U.S.R., Graph Theory, (2008)
[3]  
Chartrand G., Wilson R., The Petersen graph, Graphs and Applications, pp. 69-100, (1985)
[4]  
Guo L., Su G., Lin W., Chen J., Fault tolerance of locally twisted cubes, Appl. Math. Comput., 334, pp. 401-406, (2018)
[5]  
Guo L., Qin C., Xu L., Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes, J. Parallel Distrib. Comput., 138, pp. 190-198, (2020)
[6]  
Harary F., Conditional connectivity, Networker, 13, 3, pp. 347-357, (1983)
[7]  
Li H., Yang W., Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes, Discrete Appl. Math., 161, pp. 2753-2757, (2013)
[8]  
Lu H., On extra connectivity and extra edge-connectivity of balanced hypercubes, Int. J. Comput. Math., 94, 4, pp. 813-820, (2017)
[9]  
Ohring S., Das S., The folded Petersen network: a new communication-efficient multiprocessor topology, Proceedings of the 1993 International Conference on Parallel Processing, Vol. 1, pp. 311-314, (1993)
[10]  
Ohring S., Das S., Folded Petersen cube networks: new competitors for the hypercubes, IEEE Trans. Parallel Distrib. Syst., 7, 2, pp. 151-168, (1996)