摘要
用T2n表示有2n点的树,给出了T2n优美,强优美性.
In this article, the k - strong gracefulness for join graph T2n was studied using the definition of k - strong graceful graph. The necessary conditions for a join graph T2. to be an k - strong graceful graph for n = 2n were obtained. A join graph 2n is an k - strong graceful graph and is also k graceful graph.
出处
《佳木斯大学学报（自然科学版）》
CAS
2013年第1期140-141,共2页
Journal of Jiamusi University：Natural Science Edition
关键词
优美图
k-强优美图
K-优美图
顶点标号
边标号
graceful label
k -strong graceful graph
k -graceful graph
vertex labeling
edge labeling
