A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs
Shuangshuang Zhang, Yuzhi Xiao, Xia Liu, Jun Feng Yin · Parallel Processing Letters · 2020
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The strong matching preclusion is a well-studied measure for the network invulnerability in the event of edge failure. In this paper, we obtain the strong matching preclusion number for a class of arrangement graphs and categorize their the strong matching preclusion set, which are a supplement of known results.