Eigenvalue bounds for some classes of matrices associated with graphs

DOI10.21136/CMJ.2020.0290-19OpenAlexW3088074555MaRDI QIDQ5858489

M. Rajesh Kannan, Ranjit Mehatari

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

zbMATH Keywords

spectral radiusadjacency matrixLaplacian matrixalgebraic connectivityRandić indexnormalized adjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Bounds on normalized Laplacian eigenvalues of graphs
• An eigenvalue localization theorem for stochastic matrices and its application to Randić matrices
• Spectra of graphs
• Bounds for eigenvalues using traces
• A sharp upper bound for the number of spanning trees of a graph
• Handbook of Linear Algebra
• A new upper bound on the largest normalized Laplacian eigenvalue
• On bounding the eigenvalues of matrices with constant row-sums
• Inequalities for Graph Eigenvalues
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Eigenvalue bounds for some classes of matrices associated with graphs