| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438359 | Theoretical Computer Science | 2014 | 14 Pages |
Abstract
The torus network is one of the most popular interconnection network topologies for massively parallel computing 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 bipartite torus networks and 2-dimensional nonbipartite torus networks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shiying Wang, Kai Feng,