The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
IEEE Transactions on Computers
Graph Theory
Conditional matching preclusion sets
Information Sciences: an International Journal
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science
Fault-tolerant resource placement in balanced hypercubes
Information Sciences: an International Journal
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
Matching preclusion for k-ary n-cubes
Discrete Applied Mathematics
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
Theoretical Computer Science
Discrete Applied Mathematics
| Hi-index | 5.23 |
Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. The matching preclusion number of a graph G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph with no isolated vertices and without a perfect matching or an almost perfect matching. In this paper, we consider balanced hypercubes. We obtain that an n-dimension balanced hypercube BH"n has the matching preclusion number 2n, and mainly prove that for the balanced hypercube BH"n, each matching preclusion set of cardinality 2n is trivial, and the conditional matching preclusion number of balanced hypercube is 4n-2 whenever n=2.