Journal of East China Normal University(Natural Sc ›› 2011, Vol. 2011 ›› Issue (3): 29-34.

• Article • Previous Articles     Next Articles

Algebraic connectivity of trees with the maximum degree

GU Lei;YUAN Wei-gang; ZHANG Xiao-dong   

  1. Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, China
  • Received:2010-12-01 Revised:2011-03-01 Online:2011-05-25 Published:2011-05-25
  • Contact: GU Lei

Abstract: This paper investigated how the algebraic connectivity of trees changes under some graph perturbations. Then these results were used to characterize the extremal tree which has the smallest algebraic connectivity in the set of trees given the number of vertex and the maximum degree.

Key words: tree, Laplacian matrix, maximum degree, algebraic connectivity, tree, Laplacian matrix, maximum degree

CLC Number: