关于赋权树的谱半径的精确上界

On the Sharp Upper Bound of Spectral Radius of Weighted Trees

中文关键词:  赋权树  谱半径  匹配.

英文关键词:weighted tree  spectral radius  matching.

中文摘要:

      赋权图的谱常用来解决网络和电路设计中的问题. 这篇论文得到了给定顶点数和边独立数的所有赋权树谱半径的精确上界,并且得到了谱半径达到上界的所有赋权树.

英文摘要:

      The spectrum of weighted graphs are often used to solve the problems in the design of networks and electronic circuits. In this paper, we derive the sharp upper bound of spectral radius of all weighted trees on given order and edge independence number, and obtain all such trees that their spectral radius reach the upper bound.