Algebraic connectivity of connected graphs with fixed number of pendant vertices
Combinatorics
2010-03-25 v1
Abstract
In this paper we consider the following problem: Over the class of all simple connected graphs of order with pendant vertices ( being fixed), which graph maximizes (respectively, minimizes) the algebraic connectivity? We also discuss the algebraic connectivity of unicyclic graphs.
Keywords
Cite
@article{arxiv.1003.4646,
title = {Algebraic connectivity of connected graphs with fixed number of pendant vertices},
author = {Arbind K. Lal and Kamal L. Patra and Binod K. Sahoo},
journal= {arXiv preprint arXiv:1003.4646},
year = {2010}
}
Comments
14 pages, 11 figures