English

On the spectrum and energy of digraphs with self-loops

Combinatorics 2025-08-13 v2

Abstract

A digraph with self-loops DSD_S with vertex set V\mathcal{V} is a simple digraph with a self-loop attached at every vertex in SV.S \subset \mathcal{V}. In this paper, we study the energy E(DS)E(D_S) of DSD_S and its properties, which extend several classical results on simple directed graphs. If D1,...,DkD_1,...,D_k are the strong components of DS,D_S, we establish a necessary and sufficient conditions for E(DS)i=1kE(Di),E(D_S) \leq \sum^k_{i=1} E(D_i), for which the strict inequality exists for S.S\neq \emptyset. We also provide several bounds and characterizations for the energy and spectral radius of DS,D_S, including the McClelland type bound. Lastly, we propose a notion of the complement of DSD_S 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