Matching Preclusion of the Generalized Petersen Graph

Authors

Ajay Arora, Novi High SchoolFollow
Eddie Cheng, Oakland UniversityFollow
Christopher Melekian, Oakland UniversityFollow

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.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Arora, Ajay; Cheng, Eddie; and Melekian, Christopher (2019) "Matching Preclusion of the Generalized Petersen Graph," Theory and Applications of Graphs: Vol. 6: Iss. 1, Article 5.
DOI: 10.20429/tag.2019.060105
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol6/iss1/5