Proof of a Conjecture about k -Graceful Graph

摘要

A conjecture given in paper [1] that crown of complete bipartite graphs is k -graceful ((m = lor2 ,k≥2);(m≥3,k≥(m-2)(n-1)) is proved in this paper.