On the Sharp Upper Bound of Spectral Radius of Weighted Trees
Received:January 19, 2007  Revised:July 06, 2008
Key Word: weighted tree   spectral radius   matching.  
Fund ProjectL:the National Natural Science Foundation of China (No.10871204).
Author NameAffiliation
TAN Shang Wang Department of Applied Mathematics, China University of Petroleum, Shandong 257061, China 
Hits: 5454
Download times: 1781
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  Download reader