Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Conditional Strong Matching Preclusion Of The Alternating Group Graph, Mohamad Abdallah, Eddie Cheng
Conditional Strong Matching Preclusion Of The Alternating Group Graph, Mohamad Abdallah, Eddie Cheng
Theory and Applications of Graphs
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 AGn.