Huazhong Lü

Learn More
Matching preclusion is a measure of robustness in the event of edge failure in interconnec-tion 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(More)
The balanced hypercube, proposed by Wu and Huang, is a new variation of hypercube. The particular property of the balanced hypercube is that each processor has a backup processor that shares the same neighborhood. A Hamiltonian bipartite graph with bipartition $$V_{0}\cup V_{1}$$ V 0 ∪ V 1 is said to be Hamiltonian laceable if there is a Hamiltonian path(More)
  • 1