Bounds for the spectral radius of a graph when nodes are removed
type: Item
instance of: scholarly article
title: Bounds for the spectral radius of a graph when nodes are removed
zbMATH Open document ID: 1241.05081
author: Cong Li
author: Huijuan Wang
author: Piet Van Mieghem
published in: Linear Algebra and its Applications
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6034532
zbMATH Keywords: spectral radius
zbMATH Keywords: eigenvector
zbMATH Keywords: link
zbMATH Keywords: node
MaRDI profile type: Publication
full work available at URL: j.laa.2012.02.023
OpenAlex ID: W1972183931
cites work: The spectral radius and the maximum degree of irregular graphs
cites work: Q3497899
cites work: Extreme eigenvalues of nonregular graphs
cites work: A necessary and sufficient eigenvector condition for a connected graph to be bipartite
cites work: On the largest eigenvalue of non-regular graphs
cites work: The largest eigenvalue of nonregular graphs
cites work: Q3066830
cites work: The spectral radius of irregular graphs
DOI: 10.1016/J.LAA.2012.02.023
Recommended article: A bound for the Aα-spectral radius of a connected graph after vertex deletion
Recommended article: A bound on the spectral radius of graphs
Recommended article: A note on the bounds for the spectral radius of graphs
Recommended article: Q3110246
Recommended article: Q5483776
Recommended article: Bounds on the (Laplacian) spectral radius of graphs
Recommended article: Bounds for the Laplacian spectral radius of graphs
Recommended article: Q4796680
Recommended article: On the spectral radius of graphs
description: scientific article; zbMATH DE number 6034532