%0 Journal Article
%T 直径为d的一些树的排序<br>Sorting of Some Trees with Diameter of d
%A 谭荣
%A 姜文芳
%J Advances in Applied Mathematics
%P 1526-1530
%@ 2324-8009
%D 2023
%I Hans Publishing
%R 10.12677/AAM.2023.124158
%X 本文主要是对有n个点直径为d的树T<sub>n,d</sub>(i)，以及前<img src=\"Edit_b4bedbb4-bc3d-42de-a7e1-fb58797bc80a.png\" alt=\"\" />棵这样的树做了排序的成果(具体内容见序言部分)基础上重新讨论了上述树的另一种排序方法，并更进一步确定了它们的上界。<br />
Based on the results of sorting trees <span>T</span><sub>n,d</sub><span>(i) </span>with n-point diameter d and the previous <img src=\"Edit_d77a0737-e4cb-4335-bf80-012b580ce18b.png\" alt=\"\" />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.
%K 树，谱半径，排序，上界<br>Tree
%K Spectral Radius
%K Sorting
%K Upper Bound
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=64210