✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Xu and C.-Q Xu (Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607–1612, 2009).
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:Let G = (V, E) be a digraph with n vertices and m arcs without loops and multi-arcs.
📊
Temel Bulgular & Veri:The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix.
💡
Sonuç & Katkı:Xu and C.-Q Xu (Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607–1612, 2009).
🔬Tür:Araştırma Makalesi
📍Kapsam:2009 Verileri
⚙️Değişkenler: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).
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
GÜNGÖR, A. D., BOZKURT, Ş. B. (2022). IMPROVED BOUNDS FOR THE SPECTRAL RADIUS OF DIGRAPHS. Hacettepe Journal of Mathematics and Statistics, Cilt: 39 - Sayı: 3, 313–318. https://ajindex.com/articles/530651