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 AQn, which is a variation of the hypercube Qn that possesses favorable properties.
| Original language | English |
|---|---|
| Article number | 5 |
| Journal | Theory and Applications of Graphs |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Mar 2021 |
Fingerprint
Dive into the research topics of 'The conditional strong matching preclusion of augmented cubes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver