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

共 6 条

[1]

Bondy J. A., 1976, Graph theory with applications

[2]

Cvetkovic D., 1995, Spectra of Graphs: Theory and Applications

[3]

GUO J, 2001, LINEAR ALGEBRA ITS A, V325, P71

[4] The kth Laplacian eigenvalue of a tree [J].

Guo, Ji-Ming .

JOURNAL OF GRAPH THEORY, 2007, 54 (01) :51-57

[5] On the Laplacian spectral radius of a tree [J].

Guo, JM .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 368 :379-385

[6] BOUNDS ON THE KTH EIGENVALUES OF TREES AND FORESTS [J].

SHAO, JY .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1991, 149 :19-34

← 1 →