Bounds for eigenvalues of a graph
From MaRDI portal
Publication:3587237
Recommendations
Cited in
(22)- Lower bounds for the minimum eigenvalue of the bi-Laplacian on a graph
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- Some Bond Graph Structural Properties: Eigen Spectra and Stability
- Energy of nonsingular graphs: improving lower bounds
- Lower and upper bounds on graph communicabilities
- Bounds for Aα-eigenvalues
- Bounds on graph spectra
- Numerical range of simple graphs and some bounds for their eigenvalues
- Limit points of eigenvalues of (di)graphs
- New upper bounds on the spectral radius of graphs
- Bounds for the extreme eigenvalues of the Laplacian and signless Laplacian of a graph
- Eigenvalues and expansion of bipartite graphs
- Non-bipartiteness of graphs and the upper bounds of Dirichlet forms
- Eigenvalue bounds for some classes of matrices associated with graphs
- Bounds on graph eigenvalues
- Bounds on the algebraic connectivity of graphs
- On eigenvalue inequalities of a matrix whose graph is bipartite
- Eigenvalue estimates on a connected finite graph
- Bounds of eigenvalues of graphs
- Bounds on the greatest eigenvalue of graphs.
- On the adjacency matrix of a complex unit gain graph
- Tight estimates for eigenvalues of regular graphs
This page was built for publication: Bounds for eigenvalues of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587237)