Eigenvalue bounds for some classes of matrices associated with graphs
DOI10.21136/CMJ.2020.0290-19OpenAlexW3088074555MaRDI QIDQ5858489FDOQ5858489
Authors: Ranjit Mehatari, M. Rajesh Kannan 
Publication date: 13 April 2021
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04916
Recommendations
- Bounds of eigenvalues of graphs
- Bounds on graph eigenvalues. I
- Bounds for eigenvalues of a graph
- Bounds on graph eigenvalues
- Bounds of eigenvalues of a graph
- Bounds on graph eigenvalues. II
- Bounds of eigenvalues of a nontrivial bipartite graph.
- Bounds on the greatest eigenvalue of graphs.
- An eigenvalue bound for the Laplacian of a graph
- Some bounds on the largest eigenvalues of graphs
Laplacian matrixspectral radiusadjacency matrixalgebraic connectivitynormalized adjacency matrixRandić index
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of graphs
- Bounds on normalized Laplacian eigenvalues of graphs
- A new upper bound on the largest normalized Laplacian eigenvalue
- Graph theory with applications
- Title not available (Why is that?)
- Bounds for eigenvalues using traces
- Graphs of extremal weights
- A sharp upper bound for the number of spanning trees of a graph
- An eigenvalue localization theorem for stochastic matrices and its application to Randić matrices
- Randić matrix and Randić energy
- Handbook of linear algebra
- Inequalities for Graph Eigenvalues
- On bounding the eigenvalues of matrices with constant row-sums
Cited In (4)
This page was built for publication: Eigenvalue bounds for some classes of matrices associated with graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858489)
