1) strong gracefultree
疆优美树
2) graceful tree
优美树
1.
A mathod, by adhering a class of gracefultreeseries to a path, of constructing a larger graceful tree is given.
给出了将一类优美树序列粘接到路上，生成优美树的一种构造方
2.
A group of recurrence formulas of graceful trees is presented.
给出优美树的一组递推公式。
3.
In this paper we present the definition of graceful ordered array in I [n-2]={1,…,(n-2)} and we have the following results: (1) Every graceful ordered array in I[n-2]corresponds to a graceful tree of n vortices.
本文定义了I[n-2]={1,2,…,(n-2)}中的优序数组,并取得以下结果:(1)I[n-2]的每一个优序数组与一棵n个顶点的标号优美树对应;(2)I[n-2]的全部优序数组集合N_n与全部n个顶点已标号优美树集合T_n相对应。
3) weakly graceful tree
弱优美树
5) Strong graceful tree
强优美树
6) Guess of Graceful trees
优美树猜想
1.
Whether all trees whose diameters are four are graceful? Huang and many other scholars believe that this question is the key to the Guess of Graceful trees.
直径为四的树是否都是优美的 ,Huang等人认为这个问题是解决优美树猜想的一个关键问题 。
补充资料：疆疆
1.鸟群飞相随貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条