Strong matching preclusion for torus networks

Authors:
Shiying Wang;Kai Feng
Affiliations:
College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, PR China and School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi 0300 ...;School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi 030006, PR China
Venue:
Theoretical Computer Science
Year:
2014

Citing 8
Cited 0

Matching preclusion for some interconnection networks

Networks
Graph Theory

Graph Theory
Conditional matching preclusion sets

Information Sciences: an International Journal
Conditional matching preclusion for hypercube-like interconnection networks

Theoretical Computer Science
Matching preclusion for k-ary n-cubes

Discrete Applied Mathematics
Strong matching preclusion

Theoretical Computer Science
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products

Discrete Applied Mathematics
Matching preclusion and conditional matching preclusion for regular interconnection networks

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

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.