On the kth Laplacian eigenvalues of trees with perfect matchings

被引：6

作者：

Li, Jianxi ^{[1
]}

Shiu, Wai Chee ^{[1
]}

Chang, An ^{[2
]}

机构：

[1] Hong Kong Baptist Univ, Dept Math, Kowloon Tong, Hong Kong, Peoples R China

[2] Fuzhou Univ, Software Coll, Ctr Discrete Math, Fuzhou 350002, Fujian, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2010年 / 432卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Tree; Laplacian eigenvalue; Perfect matchings; Bound;

D O I：

10.1016/j.laa.2009.10.015

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let T-n(+) be the set of all trees of order n with perfect matchings. In this paper, we prove that for any tree T is an element of T-n(+), its kth largest Laplacian eigenvalue mu(k)(T) satisfies mu(k)(T) = 2 when n = 2k, and mu(k)(T) <= [n/2k]+2+ root([n/2k](2)+4/2 when n not equal 2k. Moreover, this upper bound is sharp when n = 0(mod 2k). (C) 2009 Elsevier Inc. All rights reserved.

引用

页码：1036 / 1041

页数：6

共 50 条

[31] On the Signless Laplacian Spectral Radius of Bicyclic Graphs with Perfect Matchings
Zhang, Jing-Ming
Huang, Ting-Zhu
Guo, Ji-Ming
SCIENTIFIC WORLD JOURNAL, 2014,
[32] Sharp lower bounds on the Laplacian eigenvalues of trees
Das, KC
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 384 : 155 - 169
[33] On the sum of the two largest Laplacian eigenvalues of trees
Mei Guan
Mingqing Zhai
Yongfeng Wu
Journal of Inequalities and Applications, 2014
[34] On the second Laplacian eigenvalues of trees of odd order
Shao, Jian-yu
Zhang, Li
Yuan, Xi-ying
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 419 (2-3) : 475 - 485
[35] MINIMAL ESTRADA INDEX OF THE TREES WITHOUT PERFECT MATCHINGS
Wang, Wen-Huan
Zhai, Chun-Xiang
ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2019, 35 : 408 - 417
[36] Ordering trees with nearly perfect matchings by algebraic connectivity
Zhang, Li
Liu, Yue
CHINESE ANNALS OF MATHEMATICS SERIES B, 2008, 29 (01) : 71 - 84
[37] Counting the Number of Perfect Matchings, and Generalized Decision Trees
Vyalyi, M. N.
PROBLEMS OF INFORMATION TRANSMISSION, 2021, 57 (02) : 143 - 160
[38] On perfect matchings and Hamilton cycles in sums of random trees
Frieze, A
Karonski, M
Thoma, L
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (02) : 208 - 216
[39] Ordering Trees with Nearly Perfect Matchings by Algebraic Connectivity
Li ZHANG Yue LIU Department of Mathematics
Department of Applied Mathematics
ChineseAnnalsofMathematics, 2008, (01) : 71 - 84
[40] Counting the Number of Perfect Matchings, and Generalized Decision Trees
M. N. Vyalyi
Problems of Information Transmission, 2021, 57 : 143 - 160

← 1 2 3 4 5 →