On the spectrum and energy of digraphs with self-loops
Abstract
A digraph with self-loops with vertex set is a simple digraph with a self-loop attached at every vertex in In this paper, we study the energy of and its properties, which extend several classical results on simple directed graphs. If are the strong components of we establish a necessary and sufficient conditions for for which the strict inequality exists for We also provide several bounds and characterizations for the energy and spectral radius of including the McClelland type bound. Lastly, we propose a notion of the complement of and establish some formulae describing the relationship between the energy and spectrum of regular digraphs with their complement.
Keywords
Cite
@article{arxiv.2508.07004,
title = {On the spectrum and energy of digraphs with self-loops},
author = {Kevin Fung and Johnny Lim},
journal= {arXiv preprint arXiv:2508.07004},
year = {2025}
}
Comments
26 pages, 1 figure. Revised reference list. Fixed some typos. Added citation to Def 5.1 & 5.2