关于直径为4的树的k-优美性  

The k-gracefulness of Trees with Diameter of Four

作　　者：李武装[1] 严谦泰[1] 

机构地区：[1]安阳师范学院数学系,河南安阳455002

出　　处：《桂林工学院学报》2007年第4期597-599,共3页Journal of Guilin University of Technology

基　　金：河南省自然科学基金资助项目(0511013800)

摘　　要：讨论了直径为4的k-优美性,证明了n>k-1时,树PG(n;r1,r2,…,rn)和PF(n;r1,r2,…,rn;rn+1)皆是k-优美树.With the development of munication. The study is based on computer, the sign of graphs is becoming popular on internet and in coman argument between Mr. G. Ringel and Mr. Slater and Mr. Thuiller. From the research of k-graceful trees with diameter of 4, it is proved that if n 〉 k - 1, then graph PG（n;r1 ,r2 ,…, rn ） and PF（ n ; r1 , r2 ,…, rn ; rn＋1 ） are k-graceful.

关 键 词：树 直径 K-优美图 k-优美标号 

分 类 号：O157.5[理学—数学]