On K—Gracefulness of Crown Complete Bipartite Graph K_(m,n)
Kong Fan-l · 2000
The Conjecture:All Crown of complete bipartite graph K m,n are K —Graceful graph when n≥m,k≥2 ,was advancedhy Mr.Ma Kejie.In this paper we demonstrat that the conjecture is established when k≥m(n+r) ,and more general results is obtained.