摘要
本文研究了一类图P1∨P4T n的优美性.利用构造函数标号的方法,证明了下面结论:对于任意正整数n,T n是n个顶点的优美树,则当n≥2时,P1∨P4T n是优美图.其中,P1是1个顶点的平凡图,P4是4个顶点的路,图P1∨P4T n是把P1之中的顶点与T n之中的每一个顶点之间都通过一个P4连接起来所得到的.
This paper studies the Gracefulness of a class graph P1 P4∨Tn by using the method of constructor labeling, Proved the following conclusion: for any positive integer n, let Tn in an n-vertex graceful tree,if n≥2 then the P1 P4∨Tn is a graceful graph. Where P1 is an 1-verex pointstrivial graph, P4 is an 4-vertex path, Graph P1 P4∨Tn is the figure of Graph P1 each vertex and fig-ure of Graph Tn every vertex between by P4 connected by a road.
出处
《吉林工程技术师范学院学报》
2014年第1期94-96,共3页
Journal of Jilin Engineering Normal University
基金
吉林省教育厅"十一五"科学技术研究项目(2007227)
关键词
优美图
树
优美标号
graceful graph
tree
graceful labeling