The Gracefulness of Two Types of Graphs
Yuxin Liu · Journal of Kunming University of Science and Technology · 2014
K. Ma proved that any connected quasi complete bipartite graph is graceful. Hoede and Kuiper obtained that any wheel is graceful. In this paper,we prove that any quasi complete bipartite graph is a graceful graph,a K- graceful graph and an alternative bipartite graph,where K is any positive integer. Furthermore,it is showed that the coronal of every wheel of order at least three is a graceful graph by construction method.