检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:喻卫 YU Wei(Department of Basic,Anhui Sanlian University, Hefei, Anhui 230601, China)
出 处:《井冈山大学学报(自然科学版)》2018年第2期14-18,共5页Journal of Jinggangshan University (Natural Science)
基 金:安徽三联学院校级自然一般资助项目(kjyb2016011)
摘 要:在任意直径为4和5的优美树的基础上进行了研究,找到了两个法则,一个加法法则,一个乘法法则,并提出了优美树群的概念。接着又提出了优美树群中的元素的合成是可以封闭的,那么一棵优美树分解成一系列子树是否是优美的,本文给出肯定的答复。然后给出"一刀切"的判断方法去判断一些树是优美的。We mainly talk about the research on the graceful tress on the basis of diameter of 4 or five. We have found two rules, one is the rule of addition rule, the other is the multiplication rule. As a result, we propose the concept of graceful trees. Furthermore, we proposed that a beautiful groups of trees in the synthesis of the elements can be closed. A beautiful tree that could be broken down into a series of sub-tree is beautiful? Finally, we also give a way to judge the "one size fits all" to judge some of the trees if beautiful are not.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15