Algebraic connectivity of connected graphs with fixed number of pendant vertices

2010/03/24 by Lal, Arbind K., Patra, Kamal L., Sahoo, Binod K.
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1003.4646

Abstract

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.

Related

• A note on algebraic connectivity of 2-connected graphs
• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• The Algebraic Connectivity and the Clique Number of Graphs
• Hamiltonian graphs of given order and minimum algebraic connectivity
• An upper bound on the algebraic connectivity of regular graphs