On the spectral radius of graphs with connectivity at most k

J. LI, W. C. SHIU, Wai Hong CHAN, A. CHANG

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 Knk , 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 Knk will be very close to n − 2 for a fixed k and a sufficiently large n. Copyright © 2008 Springer Science+Business Media, LLC.
Original languageEnglish
Pages (from-to)340-346
JournalJournal of Mathematical Chemistry
Volume46
Issue number2
DOIs
Publication statusPublished - Aug 2009

Fingerprint

Spectral Radius
Joining
Connectivity
Graph in graph theory
Industry
Vertex of a graph

Citation

Li, J., Shiu, W. C., Chan, W. H., & Chang, A. (2009). On the spectral radius of graphs with connectivity at most k. Journal of Mathematical Chemistry, 46, 340-346. doi: 10.1007/s10910-008-9465-5

Keywords

  • Energy levels
  • Spectral radius
  • Connectivity
  • Edge-connectivity