The k-gracefulness of Trees with Diameter of Four
Yan Qian-tai · Journal of Guilin University of Technology · 2007
With the development of computer,the sign of graphs is becoming popular on internet and in communication.The study is based on an 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 nk-1,then graph PG(n;r1,r2,…,rn) and PF(n;r1,r2,…,rn;rn+1)are k-graceful.