Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

The smallest values of algebraic connectivity for trees

Language

English

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. © 2012 Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag Berlin Heidelberg.

Keywords

algebraic connectivity, ordering, Tree

Publication Date

2012

Source Publication Title

Acta Mathematica Sinica, English Series

Volume

28

Issue

10

Start Page

2021

End Page

2032

Publisher

Springer Verlag

DOI

10.1007/s10114-012-0350-6

Link to Publisher's Edition

http://dx.doi.org/10.1007/s10114-012-0350-6

ISSN (print)

14398516

ISSN (electronic)

14397617

This document is currently not available here.

Share

COinS