一类树T_(k_1k_3)的优美性

The Gracefulness of Graph T_(k_1k_3)

在n阶树中用0,1,2,3,4,…,n-1,不同的n个数对应的顶点标号,使得每一条边的标号也不相同,即{1,2,3,4,…,n-1},即称这种标号是优美标号。在优美树问题中,文献[11]猜想所有的树是优美树;本文讨论了一类树T_(k_1k_3)的优美性。

A graceful labeling of an undirected graph G with n edges is a one - to - one function from the set of vertices of G to the set {0,1,2,3,...,n -1} such that the induced edges labels are all distinct. In the problem of graceful graph, reference [ 11 ] conjecture that all tree is graceful. In this paper we discuss tree Tk1 k3.