Some Bounds on the Energy of Graphs with Self-Loops regarding $\lambda_{1}$ and $\lambda_{n}$

TL;DR

This paper derives new bounds on the energy of graphs with self-loops, improving existing bounds and characterizing graphs where equality holds, based on eigenvalues and self-loop counts.

Contribution

The paper introduces improved upper bounds on graph energy with self-loops and characterizes cases of equality, extending prior results by Gutman et al.

Findings

New upper bounds on $E(G_{S})$ involving eigenvalues and self-loops.

Characterization of graphs where the bounds are tight.

Enhanced understanding of spectral properties of graphs with self-loops.

Abstract

Let $G_{S}$ be a graph with $n$ vertices obtained from a simple graph $G$ by attaching one self-loop at each vertex in $S \subseteq V(G)$. The energy of $G_{S}$ is defined by Gutman et al. as $E(G_{S})=\sum_{i=1}^{n}\left| \lambda_{i} -\frac{\sigma}{n} \right|$, where $\lambda_{1},\dots,\lambda_{n}$ are the adjacency eigenvalues of $G_{S}$ and $\sigma$ is the number of self-loops of $G_{S}$. In this paper, several upper and lower bounds of $E(G_{S})$ regarding $\lambda_{1}$ and $\lambda_{n}$ are obtained. Especially, the upper bound $E(G_{S}) \leq \sqrt{n\left(2m+\sigma-\frac{\sigma^{2}}{n}\right)}$ $(\ast)$ given by Gutman et al. is improved to the following bound \begin{align*} E(G_{S})\leq \sqrt{n\left(2m+\sigma-\frac{\sigma^{2}}{n}\right)-\frac{n}{2}\left(\left |\lambda_{1}-\frac{\sigma}{n}\right |-\left |\lambda_{n}-\frac{\sigma}{n}\right |\right)^{2}}, \end{align*} where $\left| \lambda_{1}-\frac{\sigma}{n}\right| \geq \dots \geq \left| \lambda_{n}-\frac{\sigma}{n}\right|$. Moreover, all graphs are characterized when the equality holds in Gutmans' bound $(\ast)$ by using this new bound.