Strong matching preclusion for k-ary n-cubes

Authors:
Shiying Wang;Kai Feng;Guozhen Zhang
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 11
Cited 0

Performance of the CRAY T3E multiprocessor

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
iWarp: A 100-MOPS, LIW Microprocessor for Multicomputers

IEEE Micro
Lee Distance and Topological Properties of k-ary n-cubes

IEEE Transactions on Computers
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes

Journal of Parallel and Distributed Computing
Matching preclusion for some interconnection networks

Networks
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	0.04

Visualization

Abstract

The k-ary n-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 k-ary n-cubes with n=2 and k=3.