Strong matching preclusion of burnt pancake graphs
Eddie Cheng, Justin Kelm, Roi Orzach, Brian Xu · International Journal of Parallel Emergent and Distributed Systems · 2015
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. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this paper, we examine the properties of burnt pancake graphs by finding its strong matching preclusion number and categorising all optimal solutions.