| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602862 | Linear Algebra and its Applications | 2009 | 5 Pages |
Abstract
The energy of a digraph D is defined as , where z1,…,zn are the (possibly complex) eigenvalues of D. In this article we extend to general digraphs McClelland’s inequality for the energy of a graph; we also determine sharp upper bounds for the energy of a digraph in terms of the number of arcs.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
