Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

On the spectral radius of graphs with connectivity at most k

Language

English

Abstract

In this paper, we study the spectral radius of graphs of order n with κ(G) ≤ k. We show that among those graphs, the maximal spectral radius is obtained uniquely at Kn k, which is the graph obtained by joining k edges from k vertices of K n-1 to an isolated vertex. We also show that the spectral radius of Kn k will be very close to n - 2 for a fixed k and a sufficiently large n. © 2008 Springer Science+Business Media, LLC.

Keywords

Connectivity, Edge-connectivity, Energy levels, Spectral radius

Publication Date

2009

Source Publication Title

Journal of Mathematical Chemistry

Volume

46

Issue

2

Start Page

340

End Page

346

Publisher

Springer Verlag

DOI

10.1007/s10910-008-9465-5

Link to Publisher's Edition

http://dx.doi.org/10.1007/s10910-008-9465-5

ISSN (print)

02599791

ISSN (electronic)

15728897

This document is currently not available here.

Share

COinS