Strong matching preclusion under the conditional fault model

Authors:
Jung-Heum Park;Insung Ihm
Affiliations:
School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon, Republic of Korea;Department of Computer Science and Engineering, Sogang University, Seoul, Republic of Korea
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 11
Cited 0

Fault-Hamiltonicity of Hypercube-Like Interconnection Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Matching preclusion for some interconnection networks

Networks
Conditional matching preclusion sets

Information Sciences: an International Journal
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements

IEEE Transactions on Computers
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks

IEEE Transactions on Parallel and Distributed Systems
Conditional matching preclusion for hypercube-like interconnection networks

Theoretical Computer Science
Matching preclusion for the (n, k)-bubble-sort graphs

International Journal of Computer Mathematics
Matching preclusion for k-ary n-cubes

Discrete Applied Mathematics
Conditional matching preclusion for the alternating group graphs and split-stars

International Journal of Computer Mathematics
Strong matching preclusion

Theoretical Computer Science
The diagnosability of the matching composition network under the comparison diagnosis model

IEEE Transactions on Computers

Quantified Score

Hi-index	0.04

Visualization

Abstract

Strong matching preclusion that additionally permits more destructive vertex faults in a graph [J.-H. Park, I. Ihm, Strong matching preclusion, Theoretical Computer Science 412 (2011) 6409-6419] is an extended form of the original matching preclusion that assumes only edge faults [R.C. Brigham, F. Harary, E.C. Violin, J. Yellen, Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185-192]. In this paper, we study the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. After briefly discussing some fundamental classes of graphs in the point of the conditional matching preclusion, we establish the conditional strong matching preclusion number for the class of restricted hypercube-like graphs, which include most nonbipartite hypercube-like networks found in the literature.