![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
The low energy of a digraph D with eigenvalues z
1, … , z
n
is defined as , where Re(z
i
) is the real part of the complex number z
i
. The main results in this article generalize Koolen–Moulton upper bounds for the energy of graphs to normal digraphs, i.e. digraphs with normal adjacency matrix. We show that this new bound improves the generalized McClelland upper bound for the low energy of a digraph. Also, we give a sharp lower bound for the low energy of normal digraphs.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.