A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs

Abstract

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 s...