Bounds for the spectral radius of a graph when nodes are removed
From MaRDI portal
Recommendations
- A bound for the Aα-spectral radius of a connected graph after vertex deletion
- A bound on the spectral radius of graphs
- A note on the bounds for the spectral radius of graphs
- Bounds of the spectral radius of connected graphs
- Bounds of the spectral radius of connected graphs
- Bounds on the (Laplacian) spectral radius of graphs
- Bounds for the Laplacian spectral radius of graphs
- Bounds for the Laplacian spectral radius of graphs
- scientific article; zbMATH DE number 1877024
- On the spectral radius of graphs
Cites work
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- Extreme eigenvalues of nonregular graphs
- Graph spectra for complex networks
- On the largest eigenvalue of non-regular graphs
- Principal eigenvectors of irregular graphs
- The largest eigenvalue of nonregular graphs
- The spectral radius and the maximum degree of irregular graphs
- The spectral radius of irregular graphs
Cited in
(10)- Complementarity eigenvalue analysis of connected graphs
- Bounds for graph regularity and removal lemmas
- On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
- A conjecture on the spectral radius of graphs
- A bound for the Aα-spectral radius of a connected graph after vertex deletion
- scientific article; zbMATH DE number 7656341 (Why is no real title available?)
- Largest and least H-eigenvalues of symmetric tensors and hypergraphs
- Bounds on the \(\mathcal{A}_\alpha \)-spectral radius of uniform hypergraphs with some vertices deleted
- On estimation of extremal entries of the principal eigenvector of a graph
- Spectral characterization of the complete graph removing a path
This page was built for publication: Bounds for the spectral radius of a graph when nodes are removed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417595)
