35 citations · 156 across the 42 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013★ 4 cited
The Bondage Number of the Strong Product of a Complete Graph and a Path
Weisheng Zhao, Heping Zhang
The bondage number of a graph is the cardinality of a minimum edge set whose removal from results in a graph with the domination number greater than that of . It…
math.CO2013
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Fan Wang, Heping Zhang
Ruskey and Savage asked the following question: Does every matching of for extend to a Hamiltonian cycle of ? J. Fink showed that the question is true for e…