Minimizing the algebraic connectivity of trees with given matching number - Details

author：

Li, Wei (Li, Wei.) ^[1] | Chang, An (Chang, An.) ^[2] (Scholars：常安)

Indexed by：

SCIE

Abstract：

The　algebraic　connectivity　of　a　graph　is　the　second　smallest　eigenvalue　of　the　associated　Laplacian　matrix.　In　this　paper,　we　characterize　the　extremal　tree　with　the　minimal　algebraic　connectivity　among　all　trees　of　order　n　with　given　matching　number.

Keyword：

Algebraic connectivity Matching number tree

Community：

[ 1 ] [Li, Wei]Fujian Agr & Forestry Univ, Sch Comp & Informat Sci, Fuzhou 350002, Fujian, Peoples R China
[ 2 ] [Li, Wei]Fuzhou Univ, Ctr Discrete Math & Theoret Comp Sci, Fuzhou 350003, Fujian, Peoples R China
[ 3 ] [Chang, An]Fuzhou Univ, Ctr Discrete Math & Theoret Comp Sci, Fuzhou 350003, Fujian, Peoples R China

Reprint 's Address：

常安
[Chang, An]Fuzhou Univ, Ctr Discrete Math & Theoret Comp Sci, Fuzhou 350003, Fujian, Peoples R China

Email：

liwei@fafu.edu.cn |
Anchang@fzu.edu.cn

Show more details

Related Keywords：

Fractional spanning tree packing, forest covering and eigenvalues
2016，DISCRETE APPLIED MATHEMATICS
Note on edge-disjoint spanning trees and eigenvalues
2014，LINEAR ALGEBRA AND ITS APPLICATIONS
The minimal Laplacian spectral radius of trees with given matching number
2014，LINEAR & MULTILINEAR ALGEBRA
Some upper bounds for the atom-bond connectivity index of graphs*
2012，APPLIED MATHEMATICS LETTERS

Source ：

UTILITAS MATHEMATICA

ISSN： 0315-3681

Year： 2015

Volume： 97

Page： 355-365

0 . 2 7 3

JCR@2015

0 . 2 7 9

JCR@2020

JCR Journal Grade：4

CAS Journal Grade：4

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count：

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

数学与统计学院本学院/部未明确归属的数据

Get Fulltext

Library Discovery Baidu Scholar Search Web of Science

Type
Departments

All Years Choose Year From to