Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

The algebraic connectivity of lollipop graphs

Language

English

Abstract

Let Cn,g be the lollipop graph obtained by appending a g-cycle Cg to a pendant vertex of a path on n-g vertices. In 2002, Fallat, Kirkland and Pati proved that for n≥3g-12 and g≥4, α(Cn,g)>α(Cn,g-1). In this paper, we prove that for g≥4, α(Cn,g)>α(Cn,g-1) for all n, where α(Cn,g) is the algebraic connectivity of Cn,g. © 2010 Elsevier Inc. All rights reserved.

Keywords

Algebraic connectivity, Characteristic polynomial, Lollipop graph

Publication Date

2011

Source Publication Title

Linear Algebra and its Applications

Volume

434

Issue

10

Start Page

2204

End Page

2210

Publisher

Elsevier

DOI

10.1016/j.laa.2010.12.020

Link to Publisher's Edition

http://dx.doi.org/10.1016/j.laa.2010.12.020

ISSN (print)

00243795

This document is currently not available here.

Share

COinS