| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419382 | Discrete Applied Mathematics | 2013 | 9 Pages |
Abstract
The kk-ary nn-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 kk-ary nn-cubes with n≥2n≥2 and k≥3k≥3.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shiying Wang, Kai Feng, Guozhen Zhang,