On the Graceful of a Class of Tree
Liao Jiang-dong · 2007
If the vertices of the on n vertices are labeled by the distinct numbers 0,1,2…,n-1,in such a way that the set of edge-differences(the between the labels on adjacent pairs of vertices)are exactly｛1,2…,n｝,such a labeling is called a graceful labeling.According to graceful graph definition,in the problem of graceful graph.Rosa conjectures that tree is graceful.In this paper we discuss a class of tree which is indicated with T_(K_3)~1.