Matching Preclusion of the Generalized Petersen Graph

Abstract

The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings. In this paper we determine the matching preclusion number for the generalized Petersen graph P (n, k) and classify the optimal sets.