Measure-theoretic bounds on the spectral radius of graphs from walks

DOI10.1016/j.laa.2021.04.023zbMath1466.05115OpenAlexW3157851415MaRDI QIDQ2032249

Francisco Barreras, Mikhail Hayhoe, Hamed Hassani, Victor M. Preciado

Publication date: 11 June 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2021.04.023

zbMATH Keywords

moment problemspectral radiuswalks on graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

A dynamical approach to efficient eigenvalue estimation in general multiagent networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Spektren endlicher Grafen
• Lower bounds for the clique and the chromatic numbers of a graph
• Walks and the spectral radius of graphs
• Large matchings from eigenvalues
• Spectral bounds for the clique and independence numbers of graphs
• On the spectral radius of graphs
• Bounds on graph eigenvalues. II
• On the spectral radius of graphs with a given domination number
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Spectral Radius and Degree Sequence
• The Moment Problem

This page was built for publication: Measure-theoretic bounds on the spectral radius of graphs from walks