On the Sharp Upper Bound of Spectral Radius of Weighted Trees |
Received:January 19, 2007 Revised:July 06, 2008 |
Key Words:
weighted tree spectral radius matching.
|
Fund Project:the National Natural Science Foundation of China (No.10871204). |
|
Hits: 5627 |
Download times: 1897 |
Abstract: |
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. |
Citation: |
DOI:10.3770/j.issn:1000-341X.2009.02.012 |
View Full Text View/Add Comment |