摘要
文章讨论了图P3n的优美性,得到了:当n=6k+3和n=6k+5(k为任意自然数)时,图P3n都是优美图,同时,还得到它们的优美标号递推算法等结论。
In the paper the graceful of graph P^3_n is studies. We obtain: when n=6k+3 and n=6k+5, graphs P^3_n are graceful graph and their graceful labelling algorithm, etc.
出处
《云南师范大学学报(自然科学版)》
2004年第4期15-19,共5页
Journal of Yunnan Normal University:Natural Sciences Edition
关键词
优美图
优美标号
图P^3n
Graceful graph
Graceful labelling
Graph P^3_n