The Conditional Strong Matching Preclusion of Augmented Cubes

dc.contributor.authorAbdullah, Mohammad
dc.contributor.authorCheng, Eddie
dc.contributor.otherCheng, Eddie
dc.date.accessioned2021-12-22T08:10:55Z
dc.date.available2021-12-22T08:10:55Z
dc.date.issued2021-03-01
dc.description.abstractThe 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.
dc.identifier.citationAbdallah, M., &Cheng, E. (2021). The Conditional Strong Matching Preclusion of AugmentedCubes. Theory and Applications of Graphs, 8(1), 1-20. https://doi.org/10.20429/tag.2021.080105
dc.identifier.urihttps://dspace.auk.edu.kw/handle/11675/8183
dc.identifier.urlhttps://doi.org/10.20429/tag.2021.080105
dc.publisherTheory and Applications of Graphs
dc.relationDepartment of Mathematics and Applied Sciences
dc.relation.otherCollege of Arts and Sciences
dc.titleThe Conditional Strong Matching Preclusion of Augmented Cubes
dc.typeJournal Article
dc.typePeer-Reviewed
Files