✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Xu and C.-Q Xu (Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607–1612, 2009).
📌 3 Key Takeaways
🎯
Objective & Hypothesis:Let G = (V, E) be a digraph with n vertices and m arcs without loops and multi-arcs.
📊
Key Findings & Data:The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix.
💡
Conclusion & Impact:Xu and C.-Q Xu (Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607–1612, 2009).
🔬Design:Research Article
📍Scope:2009 Verileri
⚙️Variables:Digraph · Spectral radius · Bound
Abstract
Let G = (V, E) be a digraph with n vertices and m arcs without loops and multi-arcs. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. In this note, we obtain two sharp upper and lower bounds on ρ(G). These bounds improve those obtained by G. H. Xu and C.-Q Xu (Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607–1612, 2009).
Keywords
🔖
Cite This Article
Bozkurt, Ş. B., Güngör, A. D. (2010). IMPROVED BOUNDS FOR THE SPECTRAL RADIUS OF DIGRAPHS. Hacettepe Journal of Mathematics and Statistics, Volume: 39 Issue: 3. https://ajindex.com/articles/1403697