On the energy of digraphs
Combinatorics
2019-09-17 v1
Abstract
Let be a simple digraph with eigenvalues . The energy of is defined as , is the real part of the eigenvalue . In this paper a lower bound will be obtained for the spectral radius of , 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 . Finally, digraphs are characterized in which this upper bound improves the bounds given in \cite{G-R} and \cite{T-C}.
Cite
@article{arxiv.1909.07312,
title = {On the energy of digraphs},
author = {Juan R. Carmona},
journal= {arXiv preprint arXiv:1909.07312},
year = {2019}
}