Maximizing Spectral Radius of Trees with Given Maximal Degree
Received:August 01, 2007  Revised:January 02, 2008
Key Word: trees   maximal degree   Laplacian eigenvalue   adjacency eigenvalue   spectral radius.  
Fund ProjectL:the National Natural Science Foundation of China (No.10601001); the Natural Science Foundation of Anhui Province (Nos.050460102; 070412065); Natural Science Foundation of Department of Education of Anhui Province (No.2005kj005zd); Project of Anhui Univers
Author NameAffiliation
FAN Yi Zheng Key Laboratory of Intelligent Computing \& Signal Processing, Ministry of Education of the People's Republic of China, Anhui University, Anhui 230039, China
School of Mathematical Sciences, Anhui University, Anhui 230039, China 
ZHU Ming School of Mathematical Sciences, Anhui University, Anhui 230039, China 
Hits: 2057
Download times: 1495
Abstract:
      In this paper, we characterize the trees with the largest Laplacian and adjacency spectral radii among all trees with fixed number of vertices and fixed maximal degree, respectively.
Citation:
DOI:10.3770/j.issn:1000-341X.2009.05.005
View Full Text  View/Add Comment  Download reader