Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs |
| |
Authors: | Eddie Cheng Philip Hu Roger Jia Brian Scholten James Voss |
| |
Affiliation: | 1. Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA;2. Yale University, New Haven, CT 06511, USA;3. Massachusetts Institute of Technology, Cambridge, MA 02139, USA;4. Ohio State University, Columbus, OH 43219, USA |
| |
Abstract: | The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion destroys all perfect matchings in the graph. The optimal matching preclusion sets are often precisely those which are induced by a single vertex of minimum degree. To look for obstruction sets beyond these, the conditional matching preclusion number was introduced, which is defined similarly with the additional restriction that the resulting graph has no isolated vertices. In this paper we find the matching preclusion and conditional matching preclusion numbers and classify all optimal sets for the pancake graphs and burnt pancake graphs. |
| |
Keywords: | matching pancake graph burnt pancake graph |
|
|