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 条
  • [41] The Ordering of the Unicyclic Graphs with respect to Largest Matching Root with Given Matching Number
    Gong, Luozhong
    Liu, Weijun
    JOURNAL OF MATHEMATICS, 2022, 2022
  • [42] On the largest matching roots of graphs with a given number of pendent vertices
    Zhang, Hailiang
    Chen, Guangting
    Yu, Guanglong
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 339 - 344
  • [43] Structure of the largest subgraphs of Gn,p with a given matching number
    Raz, Abigail
    DISCRETE MATHEMATICS, 2021, 344 (03)
  • [44] LARGEST EIGENVALUES OF THE DISCRETE P-LAPLACIAN OF TREES WITH DEGREE SEQUENCES
    Biyikoglu, Tuerker
    Hellmuth, Marc
    Leydold, Josef
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2009, 18 : 202 - 210
  • [45] Ordering trees with n vertices and diameter d by their largest laplacian eigenvalues
    Guo, Shu-Guang
    UTILITAS MATHEMATICA, 2007, 74 : 65 - 69
  • [46] ON THE SECOND LARGEST MULTIPLICITY OF EIGENVALUES FOR THE STIELTJES STRING SPECTRAL PROBLEM ON TREES
    Boyko, Olga
    Martynyuk, Olga
    Pivovarchik, Vyacheslav
    METHODS OF FUNCTIONAL ANALYSIS AND TOPOLOGY, 2021, 27 (03): : 217 - 226
  • [47] The spectra of some trees and bounds for the largest eigenvalue of any tree
    Rojo, O
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 414 (01) : 199 - 217
  • [48] Bounds on distance distributions in codes of given size
    Cohen, G
    Krivelevich, M
    Litsyn, S
    COMMUNICATIONS, INFORMATION AND NETWORK SECURITY, 2003, 712 : 33 - 41
  • [49] Distance spectral radius of trees with given matching number
    Ilic, Aleksandar
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (16) : 1799 - 1806
  • [50] Minimizing the algebraic connectivity of trees with given matching number
    Li, Wei
    Chang, An
    UTILITAS MATHEMATICA, 2015, 97 : 355 - 365
12345