Matching preclusion for the (n, k)-bubble-sort graphs
Eddie Cheng, László Lipták, David Sherman · International Journal of Computer Mathematics · 2010
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number for the (n, k)-bubble-sort graphs and classify all the optimal solutions.