Conditional matching preclusion for hypercube-like interconnection networks

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.

[1]  Eddie Cheng,et al.  Matching preclusion for some interconnection networks , 2007, Networks.

[2]  SonSang Hyuk,et al.  Conditional matching preclusion for hypercube-like interconnection networks , 2009 .

[3]  Hyeong-Seok Lim,et al.  Fault-Hamiltonicity of hypercube-like interconnection networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  Eddie Cheng,et al.  Conditional matching preclusion sets , 2009, Inf. Sci..

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[7]  P. S. Nagendra Rao,et al.  A class of hypercube-like networks , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[8]  Jung-Heum Park.  Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$ , 2008 .

[9]  Hyeong-Ah Choi,et al.  Graph Bipartization and via Minimization , 1989, SIAM J. Discret. Math..