直径为d的一些树的排序
Sorting of Some Trees with Diameter of d
DOI: 10.12677/AAM.2023.124158, PDF,   
作者: 谭 荣, 姜文芳：和田师范专科学校数学与信息学院，新疆 和田
关键词: 树；谱半径；排序；上界；Tree； Spectral Radius； Sorting； Upper Bound
摘要: 本文主要是对有n个点直径为d的树Tn,d(i)，以及前棵这样的树做了排序的成果(具体内容见序言部分)基础上重新讨论了上述树的另一种排序方法，并更进一步确定了它们的上界。
Abstract: 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.
文章引用：谭荣, 姜文芳. 直径为d的一些树的排序[J]. 应用数学进展, 2023, 12(4): 1526-1530. https://doi.org/10.12677/AAM.2023.124158

参考文献

[1] Cvekovic, D.M. (1981) Some Possible Directions in Further Investigation of Graph Spectra. In: Algebraic Methods in Graph Theory, Vol. 1, North-Holland, Amsterdam, pp. 47-67.
[2] Hofmeister, M. (1997) On the Two Largest Eigen-values Trees. Linear Algebra and Its Applications, 360, 43-59.
[3] Chang, A. and Huang, Q. (2003) Ordering Trees by Their Largest Eigenvalues. Linear Algebra and Its Applications, 370, 175-184. [Google Scholar] [CrossRef] 
[4] Guo, J.-M. and Shao, J.-Y. (2006) On the Spectral Radius of Trees with Fixed Diameter. Linear Algebra and Its Applications, 413, 131-147. [Google Scholar] [CrossRef] 
[5] Cvetkovic, D., Doob, M. and Sachs, H. (1980) Spectra of Graphs Theory and Applications. Academic Press, New York.
[6] Li, Q. and Feng, K. (1979) One the Largest Eigenvalue of Graphs. Acta Mathematicae Applicatae Sinica, 2, 167-175. (in Chinese)
[7] Lin, W.S. and Guo, X.F. (2006) Ordering Trees by Their Largest Eigenvalues. Linear Algebra and Its Applications, 418, 450-456. [Google Scholar] [CrossRef] 
[8] Schwenk, A. (1974) Computing the Characteristic Polynomial of a Graph. In: Bary, R., and Harary, F., Eds., Graphs and Cmbinatorics, Lecture Notes in Mathematics, Springer-Verlag, Berlin, 153-172. [Google Scholar] [CrossRef] 

为你推荐