Conditional fractional matching preclusion of n-dimensional torus networks

Abstract The fractional matching preclusion number of a graph is the minimum number of edges whose deletion results in the remaining graph that has no fractional perfect matchings. For many networks, their optimal fractional matching preclusion sets are precisely those edges incident with a single vertex. The probability that all failures concentrate around a vertex is often small. To overcome the shortcoming, we consider the concept of conditional fractional matching preclusion, in which isolated vertices are not permitted in fault networks. We establish the conditional fractional matching preclusion numbers and all possible minimum conditional fractional matching preclusion sets for n -dimensional torus networks with n ≥ 3 .