Improved upper and lower bounds for the spectral radius of digraphs

DOI10.1016/J.AMC.2010.01.080zbMath1214.05078OpenAlexW2052634365MaRDI QIDQ969143

Ayşe Dilek Güngör, Kinkar Chandra Das

Publication date: 11 May 2010

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

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

zbMATH Keywords

digraphspectral radiusbound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Sharp bounds for the signless Laplacian spectral radius of digraphs ⋮ Sharp bounds on the spectral radius of nonnegative matrices and digraphs ⋮ Some upper bounds for the signless Laplacian spectral radius of digraphs ⋮ Bounds on the spectral radii of digraphs in terms of walks

Cites Work

• Unnamed Item
• Unnamed Item
• Sharp bounds for the spectral radius of digraphs
• Recent results in the theory of graph spectra
• Spectral radius of non-negative matrices and digraphs
• Matrix Analysis

This page was built for publication: Improved upper and lower bounds for the spectral radius of digraphs