Conditional matching preclusion for hypercube-like interconnection networks

Authors:
Jung-Heum Park;Sang Hyuk Son
Affiliations:
School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon 420-743, Republic of Korea;Department of Computer Science, University of Virginia, Charlottesville, VA 22904, United States
Venue:
Theoretical Computer Science
Year:
2009

Citing 5
Cited 12

Graph bipartization and via minimization

SIAM Journal on Discrete Mathematics
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
Graph Theory With Applications

Graph Theory With Applications
Matching preclusion for some interconnection networks

Networks
Conditional matching preclusion sets

Information Sciences: an International Journal

Matching preclusion for k-ary n-cubes

Discrete Applied Mathematics
Conditional matching preclusion for the arrangement graphs

Theoretical Computer Science
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 bipartite interconnection networks I: Sufficient conditions

Networks
Matching preclusion and conditional matching preclusion for regular interconnection networks

Discrete Applied Mathematics
Matching preclusion for balanced hypercubes

Theoretical Computer Science
Linearly many faults in dual-cube-like networks

Theoretical Computer Science
Strong matching preclusion under the conditional fault model

Discrete Applied Mathematics
The (conditional) matching preclusion for burnt pancake graphs

Discrete Applied Mathematics
Strong matching preclusion for k-ary n-cubes

Discrete Applied Mathematics
Strong matching preclusion for torus networks

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some HL-graphs, hypercube-like interconnection networks.