The Conditional Strong Matching Preclusion of Augmented Cubes
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...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2021
|
| Online Access: | https://dspace.auk.edu.kw/handle/11675/8183 https://doi.org/10.20429/tag.2021.080105 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|