The Conditional Strong Matching Preclusion of Augmented Cubes

Authors

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

Abstract

The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or adjacent to the same vertex. This motivates Park et al. to introduce the conditional strong matching preclusion of a graph. In this paper we consider the conditional strong matching preclusion problem of the augmented cube AQ_n, which is a variation of the hypercube Q_n that possesses favorable properties.

Creative Commons License

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

Recommended Citation

Abdallah, Mohamad and Cheng, Eddie (2021) "The Conditional Strong Matching Preclusion of Augmented Cubes," Theory and Applications of Graphs: Vol. 8: Iss. 1, Article 5.
DOI: 10.20429/tag.2021.080105
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol8/iss1/5