The Second Largest Eigenvalue of Trees
Received:November 12, 2001  
Key Words: tree   upper bound   eigenvalue   matching.  
Fund Project:
Author NameAffiliation
TAN Shang-wang Dept. of Appl. Math.
University of Petroleum
Shangdong
China 
GUO Ji-ming Dept. of Appl. Math.
University of Petroleum
Shangdong
China 
Hits: 2545
Download times: 1196
Abstract:
      In this paper, the tight upper bounds of the second maximum eigenvalues on trees with the edge independence number n and order 2n + 2 are obtained. Meanwhile, all extreme trees which reach the upper bounds are given.
Citation:
DOI:10.3770/j.issn:1000-341X.2004.03.023
View Full Text  View/Add Comment  Download reader
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.