Fractional strong matching preclusion of some Cartesian product graphs
Bo Zhu, Shumin Zhang, Chenfu Ye · Journal of Physics Conference Series · 2021
Abstract The fractional strong matching preclusion number of a graph is the minimum number of edges and vertices whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional strong matching preclusion number for the Cartesian product of a graph and a cycle. As an application, the fractional strong matching preclusion number for torus networks is also obtained.