Energy of Nonsingular Graphs: Improving Lower Bounds

LetG be a simple graph of order n andA be its adjacencymatrix. Let λ1 ≥ λ2 ≥ . . . ≥ λn be eigenvalues of matrixA.*en, the energy of a graph G is defined as ε(G) � 􏽐ni�1 |λi|. In this paper, we will discuss the new lower bounds for the energy of nonsingular graphs in terms of degree sequence, 2-sequence, the first Zagreb index, and chromatic number. Moreover, we improve some previous well-known bounds for connected nonsingular graphs.


Introduction
In this paper, we assume that G is a simple graph and that V(G) and E(G) are the vertex set and the edge set so that |V(G)| � n and |E(G)| � m. Let d i be the degree of vertex v i . For convenience, we assume here that K n and K a,b are the complete graph and the complete bipartite graph, respectively.
Graph coloring is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called vertex coloring. e smallest number of colors needed to color a graph G is called its chromatic number of G, denoted by χ(G). e sum of the degrees of the vertices adjacent to v i is call the 2-degree of v i and denoted by h i . e average degree is 2 degree, and we denote by h i /d i the average degree of v i . e first Zagreb of G, introduced in [1], is defined as follows: Assuming that λ 1 ≥ λ 2 ≥ . . . ≥ λ n is eigenvalues of adjacency matrix A, we know that If det(A) � 0, we call G singular, otherwise we call it nonsingular.
According to the eigenvalues of the adjacency matrix, the energy of a graph is defined as follows: Graph energy was first used in chemistry to approximate the energy of π-electron of a molecule [2,3].
Liu et al. [4] derived some new bounds for the energy. Filipovski and Jajcay [5], derived some of the bounds for the energy. Das and Gutman [6] discussed bounds for the energy and improved some of the bounds. In 2017, Jahanbani [7] obtained some of the lower bounds for the energy. In 2018, Jahanbani [8] obtained some of the upper bounds for the energy and improved well-known bounds. In 2020, Filipovski and Jajcay [5] derived some of lower bounds for the energy. In 2021, Filipovski and Jajcay [5] obtained new bounds for the energy. In this paper, we continue this discussion by obtaining new bounds for the energy of nonsingular connected graph and improving some important bounds. e oldest bounds are discovered by McClelland [9][10][11][12]. Bounds have been favored by researchers in the mathematical sciences, see [5,6,8,[13][14][15][16][17].
McClelland, in [12], obtained the next result: e proof of the following bound can be found in [18]: e next result is obtained by Das et al. in [19]:

Preliminaries
In this section, we recall some of the results that we will need to prove the main results.
It is straightforward to demonstrate the following two results.

Lemma 1.
Consider function f 1 as follows: en, functions f 1 (y) are increasing for y ≥ 1 and decreasing for 0 < y ≤ 1.
Lemma 3 (see [20]). For a connected graph G with n vertices and m edges, we have Lemma 4 (see [21]). For a nonempty graph, we have Lemma 5 (see [22,23]). For a connected graph with n vertices, we have Lemma 6 (see [20]). For a connected graph with chromatic number χ, we have Lemma 7 (see [24]). Suppose G be a graph with n ≥ 2 vertices; then, where c ij is the number of common neighbours of i and j.
Lemma 8 (see [24]). Suppose G be a graph with n vertices; then, where c ij is the number of common neighbours of i and j.
Lemma 9 (see [25]). Let G be a graph; then, it has only one distinct eigenvalue if and only if G is an empty graph and G has 2 distinct eigenvalues λ 1 > λ 2 with multiplicities s 1 and s 2 if and only if G is the direct sum of m 1 complete graphs of order λ 1 + 1. Also, λ 2 � −1 and s 2 � s 1 λ 1 .

Lower Bounds for the Energy of Nonsingular Graphs
In this section, we present new lower bounds for energy of a nonsingular graph G.
Theorem 1. Let G be a nonempty and nonsingular graph with n vertices and m edges. en, Equality holds if and only if G � K n .
Proof. Note that G is nonsingular; hence, we have where y > 0, and the equality holds if and only if y � 1. By applying the definition of energy, we can write By Lemma 5, we have λ 1 ≥ �������� M 1 (G)/n. From Lemma 2, we obtain From the above result and equality (16), we get our result. Now, to prove the second part of the theorem, if G � K n , it can be easily seen that the equality in eorem 1 holds. Conversely, if the equality in eorem 1 holds, then, by Lemma 5, we obtain Note that G is a nonempty graph; by using Lemma 9, we know that the graph G has at least two distinct eigenvalues. Hence, we continue the proof with the following two cases.

Case 2.
e absolute value of all eigenvalues of G is not equal.
en, G has 2 distinct eigenvalues with different absolute values. Similar to Case 1, we have that the absolute values of λ 2 , . . . λ n is 1. Since, n i�1 λ i � 0 and λ i � −1 for (2 ≤ i ≤ n), then we have λ 1 � n − 1. Hence, λ 1 has multiplicity 1 and λ i � −1 has multiplicity n − 1. By Lemma 9, G is the direct sum of a complete graph of order λ 1 + 1 � n. In other words, G � K n . □ Using the technique to demonstrate eorem 1, we get the next result.

Theorem 2.
For any nonempty and nonsingular connected graph G with n vertices and chromatic number χ, we have Equality in (19) holds if and only if G � K n .

Theorem 3. For any nonempty and nonsingular graph G
with n vertices, we have Proof. Note that G is nonsingular; hence, we have |λ i | > 0, for i � 1, 2, . . . , n. us, By equality (16), we can write From Lemma 4, we have

Journal of Mathematics
By inequality (23) and equality (22), we get our result.

Theorem 4. For any nonempty and nonsingular graph with n vertices, we have
Proof. With the same argument as before, we can write From Lemma 7, we obtain According to the properties of function g, we have that From the above inequality and equality (25), we obtain our result.
Similarly to eorem 4 and by using Lemma 8, we can reach the following result. □ Theorem 5. Let G be a nonempty and nonsingular graph with n vertices. en,

Improving Some of Bounds for the Energy of Connected Nonsingular Graphs
In this section, we show that the lower bounds in (14) and (20) are better than the classical bound [19] given by for nonsingular connected graphs. Moreover, we show that inequality (20) is better than inequality (14).

Theorem 6.
e bound in (14) improves the well-known bound in (6) for all connected nonsingular graphs.

Corollary 1.
e bound in (14) improves the well-known bound in (4) for all connected nonsingular graphs.

Theorem 7.
e bound in (20) improves the well-known bound in (6) for all connected nonsingular graphs.

Theorem 8.
e bound in (20) improves the bound in (14) for all connected nonsingular graphs.
Proof. Since