Journal ArticleOPEN ACCESS

On the spectral radius of graphs with cut vertices

Journal of Combinatorial Theory. Series B (2001) 83(2) 233-240
DOI: 10.1006/jctb.2001.2052
141Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the spectral radius of graphs with n vertices and k cut vertices and describe the graph that has the maximal spectral radius in this class. We also discuss the limit point of the maximal spectral radius. © 2001 Academic Press.

Author supplied keywords

Cite

CITATION STYLE

APA

Berman, A., & Zhang, X. D. (2001). On the spectral radius of graphs with cut vertices. Journal of Combinatorial Theory. Series B, 83(2), 233–240. https://doi.org/10.1006/jctb.2001.2052

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