On the graceful of tree T_3~1
Na Jiang · Journal of Changchun University · 2007
If the vertices of on n vertices are labeled by the distinct numbers 0,1,2,…,n-1,in such a way that the set of edgedifferences is exactly {1,2,…,n},then such a labeling is called a graceful labeling.In the problem of graceful graph,reference[3]conjecture that tree is graceful.In this paper we discuss a class of tree,which are indicated with T13.