The minimal Laplacian spectral radius of trees with given matching number - Details

author：

Li, W. (Li, W..) ^[1] | Chang, A. (Chang, A..) ^[2]

Indexed by：

Scopus

Abstract：

Let　denote　the　set　of　trees　on　vertices　with　fixed　matching　number.　In　this　paper,　the　tree　with　minimal　Laplacian　spectral　radius　over　is　determined,　where　is　an　integer　greater　than　one　i.e.　a　conjecture　posed　by　Feng　et　al.　is　proved　(see　[Feng　LH,　Li　Q,　Zhang　XD.　Minimizing　the　Laplacian　spectral　radius　of　trees　with　given　matching　number.　Linear　and　Multilinear　Algebra.　2007;55:199-207]).　©　2013　©　2013　Taylor　&　Francis.

Keyword：

Laplacian spectral radius; matching number; trees; unit eigenvector

Community：

[ 1 ] [Li, W.]Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou, China
[ 2 ] [Li, W.]Department of Information and Computing Science, School of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou, China
[ 3 ] [Chang, A.]Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou, China

Reprint 's Address：

[Chang, A.]Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou, China

Email：

candy171@163.com

Show more details

Related Keywords：

Source ：

Linear and Multilinear Algebra

ISSN： 0308-1087

Year： 2014

Issue： 2

Volume： 62

Page： 218-228

0 . 7 3 8

JCR@2014

0 . 9 0 0

JCR@2023

ESI HC Threshold：86

JCR Journal Grade：2

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count： 0

SCOPUS Cited Count： 4

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 3

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to