关于谱半径达到第二大的赋权树(英文)

On the Weighted Trees which have the Second Largest Spectral Radius

赋权图的谱的研究已经被用来解决很多实际问题,网络设计以及电路设计实际上都依赖于赋权图．本文主要研究的是赋权树的谱半径,从而得到赋权树谱半径达到次大的是双星图Sn-3,1ω*．

It is well known that the spectrum of weighted graphs are often used to solve problems. This is because graphs of the design of networks or electronic circuits are usually weighted. In this paper, the spectral radii of trees with edge weights is discussed. We prove that the weighted double-star Sn-3,1^w＊ has the second largest spectral radius of all the weighted tress with n vertices.