The McClelland inequality for the energy of digraphs

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.