一类蜘蛛树的(k,d)-优美标号

(k,d)-gracefulness of spider tree

(k,d)-优美标号因为参数k,d可以取很多值,从而使得一些优美图是(k,d)-优美标号的特例.本文给出了(k,d)-优美标号的概念,定义了T(n+1,m)-蜘蛛树,并证明了T(n+1,m)-蜘蛛树不同情形下的(k,d)-优美标号.

（k ,d）- graceful tabeling＇s parameters k ,d can be taken to a lot of values. It makes some graceful graphs is special cases of （k,d）- graceful labeling. This paper presented the concept of （k ,d）- graceful labeling, defined T（n＋1 ,rn）- spider tree,and proved （k ,d）- graceful labeling in different situations of T（n ＋1 ,m）- spider.