Bounds on the largest eigenvalues of trees with a given size of matching

被引：83
|
作者：
Hou, YP [1 ]
Li, JS
机构：
[1] Hunan Normal Univ, Dept Math, Changsha 410081, Hunan, Peoples R China
[2] Univ Sci & Technol China, Dept Math, Hefei 230026, Anhui, Peoples R China
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 2002年 / 342卷 / 1-3期
基金：
中国国家自然科学基金;
关键词：
tree; matching; the largest eigenvalue of a graph; upper bound;
D O I：
10.1016/S0024-3795(01)00465-7
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Very little is known about upper bound for the largest eigenvalue of a tree with a given size of matching. In this paper, we find some upper bounds for the largest eigenvalue of a tree in terms of the number of vertices and the size of matchings, which improve some known results. (C) 2002 Elsevier Science Inc. All rights reserved.
引用
收藏
页码：203 / 217
页数：15
相关论文
共 50 条
  • [21] BOUNDS ON THE KTH EIGENVALUES OF TREES AND FORESTS
    SHAO, JY
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 149 : 19 - 34
  • [22] On the sum of the two largest Laplacian eigenvalues of trees
    Mei Guan
    Mingqing Zhai
    Yongfeng Wu
    Journal of Inequalities and Applications, 2014
  • [23] Improved bounds for the largest eigenvalue of trees
    Rojo, O
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 404 : 297 - 304
  • [24] On the sum of the two largest Laplacian eigenvalues of trees
    Guan, Mei
    Zhai, Mingqing
    Wu, Yongfeng
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2014, : 1 - 7
  • [25] On the largest and least eigenvalues of eccentricity matrix of trees
    He, Xiaocong
    Lu, Lu
    DISCRETE MATHEMATICS, 2022, 345 (01)
  • [26] BOUNDS ON THE LARGEST ROOT OF THE MATCHING POLYNOMIAL
    FISHER, DC
    RYAN, J
    DISCRETE MATHEMATICS, 1992, 110 (1-3) : 275 - 278
  • [27] ON BOUNDS FOR THE SMALLEST AND THE LARGEST EIGENVALUES OF GCD AND LCM MATRICES
    Altinisik, Ercan
    Buyukkose, Serife
    MATHEMATICAL INEQUALITIES & APPLICATIONS, 2016, 19 (01): : 117 - 125
  • [28] Probability bounds given by hypercherry trees
    Bukszár, J
    Szántai, T
    OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (03): : 409 - 422
  • [29] Sharp lower bounds on the Laplacian eigenvalues of trees
    Das, KC
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 384 : 155 - 169
  • [30] TREES WITH MAXIMUM SUM OF THE TWO LARGEST LAPLACIAN EIGENVALUES
    Zheng, Yirong
    Li, Jianxi
    Chang, Sarula
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2022, 38 : 357 - 366
12345