A Proof of a Conjecture About k-graceful Graph
Li Wu · Journal of Henan University of Science & Technology · 2011
Bipartite graphs are widely applied,but not all bipartite graphs are graceful graphs.Therefore,it is necessary to research their gracefulness further.Based on the conjecture put forwarded by professor Ma Kejie that crown of complete bipartite graphs is k-graceful(m≤n,k≥2),the conjecture is proved by construction method when(m=1or 2,k≥2);(m≥3,k≥(m-2)(n-1)) in the paper.The k-graceful research rang is extended.