Strong matching preclusion for n-dimensional torus networks

Abstract

The strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion results in the remaining graph that has neither perfect matchings nor almost perfect matchings. In [14], Wang et al. proved that Ck□⋯□Ck is super strongly matched, where k(≥3) is odd. In this paper, we show that Ck1□Ck2□⋯□Ckn is super strongly matched, where n(≥3) is an integer and ki(≥3) is an odd integer for each i∈[1,n]. Our studies generalize the results of Wang et al. [14].