IMPROVED BOUNDS FOR THE SPECTRAL RADIUS OF DIGRAPHS

Authors : Ş Burcu BOZKURT, A Dilek GÜNGÖR

Pages : 313-318

View : 21 | Download : 9

Publication Date : 2010-03-01

Article Type : Research Paper

Abstract :Let G = insert ignore into journalissuearticles values(V, E); be a digraph with n vertices and m arcs without loops and multi-arcs. The spectral radius ρinsert ignore into journalissuearticles values(G); of G is the largest eigenvalue of its adjacency matrix. In this note, we obtain two sharp upper and lower bounds on ρinsert ignore into journalissuearticles values(G);. These bounds improve those obtained by G. H. Xu and C.-Q Xu insert ignore into journalissuearticles values(Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607–1612, 2009);.
Keywords : Digraph, Spectral radius, Bound