Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4632321 | Applied Mathematics and Computation | 2010 | 9 Pages |
Abstract
Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius Ï(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on Ï(G) are given. We show that some known bounds can be obtained from our bounds.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
A. Dilek Güngör, Kinkar Ch. Das,