English

On the energy of digraphs

Combinatorics 2019-09-17 v1

Abstract

Let DD be a simple digraph with eigenvalues z1,z2,...,znz_1,z_2,...,z_n. The energy of DD is defined as E(D)=i=1nRe(zi)E(D)= \sum_{i=1}^n |Re(z_i)|, is the real part of the eigenvalue ziz_i. In this paper a lower bound will be obtained for the spectral radius of DD, wich improves some the lower bounds that appear in the literature \cite{G-R}, \cite{T-C}. This result allows us to obtain an upper bound for the energy of D D . Finally, digraphs are characterized in which this upper bound improves the bounds given in \cite{G-R} and \cite{T-C}.

Keywords

Cite

@article{arxiv.1909.07312,
  title  = {On the energy of digraphs},
  author = {Juan R. Carmona},
  journal= {arXiv preprint arXiv:1909.07312},
  year   = {2019}
}