The k-Gracefulness of the Crown
Liu Yu-xing · Journal of Gannan Normal University · 2011
The gracefulness of graphs is an important quality,having widespread application.R.Frucht proved that any crown is a graceful graph.By construction method,it is testified that the crown is k-graceful if n is even;the crown is not k-graceful if n is odd,where k is any integer with k1.The result enriches the graceful theory of graphs and have referenced value for the research of the k-graceful of other graphs.