The smallest values of algebraic connectivity for trees

Jian Xi Li; Ji Ming Guo; Wai Chee Shiu

doi:10.1007/s10114-012-0350-6

The smallest values of algebraic connectivity for trees

Jian Xi Li
, Ji Ming Guo
, Wai Chee Shiu

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

6 Citations (Scopus)

Abstract

The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ℐ _n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ℐ _n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al.

Original language	English
Pages (from-to)	2021-2032
Number of pages	12
Journal	Acta Mathematica Sinica, English Series
Volume	28
Issue number	10
DOIs	https://doi.org/10.1007/s10114-012-0350-6
Publication status	Published - Sept 2012

User-Defined Keywords

algebraic connectivity
ordering
Tree

Access to Document

10.1007/s10114-012-0350-6

Cite this

@article{92f5be0b6fa64a0d97788d78e319393c,

title = "The smallest values of algebraic connectivity for trees",

abstract = "The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ℐ n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ℐ n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al.",

keywords = "algebraic connectivity, ordering, Tree",

author = "Li, \{Jian Xi\} and Guo, \{Ji Ming\} and Shiu, \{Wai Chee\}",

note = "Funding Information: Received June 25, 2010, accepted May 5, 2011 Supported by FRG, Hong Kong Baptist University, National Science Foundation (NSF) of China (Grant Nos. 10871204, 11101358), NSF of Fujian (Grant Nos. 2011J05014, 2011J01026), Project of Fujian Education Department (Grant No. JA11165), Fundamental Research Funds for the Central Universities (Grant No. 09CX04003A), Research Fund of Zhangzhou Normal University (Grant No. SJ1004) 1) Corresponding author",

year = "2012",

month = sep,

doi = "10.1007/s10114-012-0350-6",

language = "English",

volume = "28",

pages = "2021--2032",

journal = "Acta Mathematica Sinica, English Series",

issn = "1439-8516",

publisher = "Springer Verlag",

number = "10",

}

TY - JOUR

T1 - The smallest values of algebraic connectivity for trees

AU - Li, Jian Xi

AU - Guo, Ji Ming

AU - Shiu, Wai Chee

N1 - Funding Information: Received June 25, 2010, accepted May 5, 2011 Supported by FRG, Hong Kong Baptist University, National Science Foundation (NSF) of China (Grant Nos. 10871204, 11101358), NSF of Fujian (Grant Nos. 2011J05014, 2011J01026), Project of Fujian Education Department (Grant No. JA11165), Fundamental Research Funds for the Central Universities (Grant No. 09CX04003A), Research Fund of Zhangzhou Normal University (Grant No. SJ1004) 1) Corresponding author

PY - 2012/9

Y1 - 2012/9

N2 - The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ℐ n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ℐ n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al.

AB - The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let ℐ n be the set of all trees of order n. In this paper, we will provide the ordering of trees in ℐ n up to the last eight trees according to their smallest algebraic connectivities when n ≥ 13. This extends the result of Shao et al.

KW - algebraic connectivity

KW - ordering

KW - Tree

UR - https://www.scopus.com/pages/publications/84866129430

U2 - 10.1007/s10114-012-0350-6

DO - 10.1007/s10114-012-0350-6

M3 - Journal article

AN - SCOPUS:84866129430

SN - 1439-8516

VL - 28

SP - 2021

EP - 2032

JO - Acta Mathematica Sinica, English Series

JF - Acta Mathematica Sinica, English Series

IS - 10

ER -

The smallest values of algebraic connectivity for trees

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this