The k-Gracefulness of the Coronal of Complete Bipartite Graphs
Liu Yu-xing · Journal of Gannan Normal University · 2010
The gracefulness of graphs is an important quality,having widespread application.Ma kejie guessed that the coronal of any complete bipartite graphis a-graceful graph,where is any positive integer.It is proved that this conjecture is true by the construction method for m=2,3,4,5 or k(m-1)n.The result enriches the graceful theory of graphs.