Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

Graphs and Combinatorics (Impact Factor: 0.39). 03/2011; 27(2):215-229. DOI: 10.1007/s00373-010-0975-0
Source: arXiv


In this paper, we consider the following problem. Over the class of all simple connected graphs of order n with k pendant vertices (n, k being fixed), which graph maximizes (respectively, minimizes) the algebraic connectivity? We also discuss the algebraic connectivity
of unicyclic graphs.

KeywordsLaplacian matrix–Algebraic connectivity–Characteristic set–Perron component–Pendant vertex

Download full-text


Available from: A. K. Lal, May 09, 2014
Show more