On the spectrum and energy of digraphs with self-loops

TL;DR

This paper investigates the energy and spectral properties of directed graphs with self-loops, extending classical results, and introduces bounds, characterizations, and a notion of graph complement to deepen understanding of their spectral behavior.

Contribution

It extends classical spectral results to digraphs with self-loops, providing new bounds, conditions, and a notion of complement for their energy and spectral radius.

Findings

Established necessary and sufficient conditions for energy inequalities.

Provided bounds and characterizations for energy and spectral radius.

Introduced a notion of the complement of digraphs and related spectral properties.

Abstract

A digraph with self-loops $D_S$ with vertex set $\mathcal{V}$ is a simple digraph with a self-loop attached at every vertex in $S \subset \mathcal{V}.$ In this paper, we study the energy $E(D_S)$ of $D_S$ and its properties, which extend several classical results on simple directed graphs. If $D_1,...,D_k$ are the strong components of $D_S,$ we establish a necessary and sufficient conditions for $E(D_S) \leq \sum^k_{i=1} E(D_i),$ for which the strict inequality exists for $S\neq \emptyset.$ We also provide several bounds and characterizations for the energy and spectral radius of $D_S,$ including the McClelland type bound. Lastly, we propose a notion of the complement of $D_S$ and establish some formulae describing the relationship between the energy and spectrum of regular digraphs with their complement.