【摘要】 设Tn为n个顶点的树的集合,Hofmeister M.对Tn中的树的最大特征值进行排序,给出了第1至第5位的序;CHANG An又给出了第6至第8位的序.讨论了树的最大特征值,确定了第9位的值及对应的树.更多还原

【Abstract】 The set of trees with n vertices is denoted by Tn.Hofmeister has determined the first five values of the largest eigenvalue of trees in Tn and the corresponding trees for these values.In other words,an order of the first five trees in Tn by their largest eigenvalues has been given.Chang An has determined the sixth to eighth trees in the above ordering.In this paper,the order to the ninth tree is extended.更多还原