Bounds on the spectral radii of digraphs in terms of walks

DOI10.1016/j.amc.2012.09.073zbMath1311.05120OpenAlexW2041093075MaRDI QIDQ2344661

Yanyan Li

Publication date: 15 May 2015

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.09.073

zbMATH Keywords

digraphspectral radiusboundwalk

Mathematics Subject Classification ID

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

Related Items (1)

Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The new upper bounds on the spectral radius of weighted graphs
• Spektren endlicher Grafen
• Walks and the spectral radius of graphs
• A sharp upper bound on the spectral radius of weighted graphs
• Spectra of digraphs
• Improved upper and lower bounds for the spectral radius of digraphs
• Sharp bounds for the spectral radius of digraphs
• Bounds and inequalities for the Perron root of a nonnegative matrix
• Some new bounds on the spectral radius of graphs
• On the spectral radius of graphs with cut vertices
• Spectral radius of non-negative matrices and digraphs
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

This page was built for publication: Bounds on the spectral radii of digraphs in terms of walks