Conditional Strong Matching Preclusion of the Alternating Group Graph

Authors

Mohamad Abdallah, American University of KuwaitFollow
Eddie Cheng, Oakland UniversityFollow

Abstract

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. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this paper, we find the conditional strong matching preclusion number for the n-dimensional alternating group graph AG_n.

Creative Commons License

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

Recommended Citation

Abdallah, Mohamad and Cheng, Eddie (2019) "Conditional Strong Matching Preclusion of the Alternating Group Graph," Theory and Applications of Graphs: Vol. 6: Iss. 2, Article 5.
DOI: 10.20429/tag.2019.060205
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol6/iss2/5