List your company

Algebraic connectivity of connected graphs with fixed number of pendant vertices

About

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 benchmarks

No related benchmarks have been indexed for this paper yet.