Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs
Xiang-Jun Li, Jun‐Ming Xu · Mathematical Sciences Letters · 2012
This paper considers a kind of generalized measure of fault tolerance in the -star graph for and , and determines , which implies that at least edges of have to remove to get a disconnected graph that contains no vertices of degree less than . This result shows that the -star graph is robust when it is used to model the topological structure of a large-scale parallel processing system.