On the spectral radius of graphs with cut edges

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at Knk, where Knk is a graph obtained by joining k independent vertices to one vertex of Kn-k. We also discuss the limit point of the maximal spectral radius. © 2004 Elsevier Inc. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Liu, H., Lu, M., & Tian, F. (2004). On the spectral radius of graphs with cut edges. Linear Algebra and Its Applications, 389(1–3), 139–145. https://doi.org/10.1016/j.laa.2004.03.026

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free