摘要
定义了图P3n,得到了结论 :当n =6k和n =6k +1(k为任意自然数 )时 ,图P3n 都是优美图 ,同时 。
The definition of P 3 n is given and its gracefulhess is investigated. The conclusion is:when n=6k and n=6k+1, P 3 n are graceful graphs, and meanwhile their graceful labelling algorithms are obtained.
出处
《华南师范大学学报（自然科学版）》
CAS
2000年第3期21-24,共4页
Journal of South China Normal University(Natural Science Edition)
关键词
优美图
优美标号
奇点
偶点
递推算法
graceful graph
graceful labelling
graph P 3 n
odd vertex
even vertex.
