# Algebraic connectivity of connected graphs with fixed number of pendant vertices

Source: [Algebraic connectivity of connected graphs with fixed number of pendant vertices](<https://www.sota2.com/research/paper/68fa4eaa1e209131ce95d312>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T09:53:49.546Z

Authors: Arbind K. Lal, Kamal L. Patra, Binod K. Sahoo

Published: 2010-03-24T13:54:46.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1003.4646>)

[PDF](<https://arxiv.org/pdf/1003.4646.pdf>)
