摘要
得到一种构造0-可旋转树的方法,证明了:若树T(n)和T(m)均为0-可旋转树,则每棵树(T(m)ΔT(n))uj(j[1,n])都是0-可旋转树.确定了无穷多0-可旋转树.
If trees T(n) and T(m) are 0-rotatable trees,then each tree(T(m)ΔT(n))uj(j) is 0-rotatable tree.The above conclusion is proved by constructive method.Thus,a constructive method for building 0-rotatable tree is given,and an infinite number of 0-totatable trees are determined using this method.
出处
《华南师范大学学报(自然科学版)》
CAS
北大核心
2011年第4期54-57,共4页
Journal of South China Normal University(Natural Science Edition)
基金
国家自然科学基金项目(61163054
61163037)
关键词
优美标号
0-可旋转树
强0-可旋转树
graceful labeling
0-rotatable trees
strongly 0-rotatable trees