Back to Search
Start Over
Strong matching preclusion for -ary -cubes.
- Source :
-
Discrete Applied Mathematics . Dec2013, Vol. 161 Issue 18, p3054-3062. 9p. - Publication Year :
- 2013
-
Abstract
- Abstract: The -ary -cube is one of the most popular interconnection networks for parallel and distributed systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is a more extensive form of the original matching preclusion that assumes only edge faults. In this paper, we establish the strong matching preclusion number and all minimum strong matching preclusion sets for -ary -cubes with and . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 161
- Issue :
- 18
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 91952467
- Full Text :
- https://doi.org/10.1016/j.dam.2013.06.011