摘要
本文主要是对有n个点直径为d的树Tn,d(i),以及前棵这样的树做了排序的成果(具体内容见序言部分)基础上重新讨论了上述树的另一种排序方法,并更进一步确定了它们的上界。
Based on the results of sorting trees Tn,d(i) with n-point diameter d and the previous trees with n-point diameter d (see the preface for details), this paper rediscusses another sorting method of the above-mentioned trees, and their upper bounds are further determined.
出处
《应用数学进展》
2023年第4期1526-1530,共5页
Advances in Applied Mathematics