Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs

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

Notes

^1. Email: [email protected]

^2. Email: [email protected]

^3. Email: [email protected]

^4. Email: [email protected]

^5. Email: [email protected]

Additional information

Funding

Funding

Research partially supported by the NSF-REU [grant DMS 0649099].