Let G be a graph on n vertices and m edges, with maximum degree Δ (G) and minimum
degree δ (G). Let A be the adjacency matrix of G, and let λ 1≥ λ 2≥…≥ λ n be the …

The energy of a simple graph G of order n, denoted by E (G), is E (G)=| λ 1|+⋯+| λ n|, where λ
1,…, λ n are the eigenvalues of G. Recently, it has been conjectured that if all eigenvalues of …

New Upper Bounds on the Energy of a Graph 1 Introduction Page 1 MATCH Communications in
Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 90 (2023) …

The energy of a graph G, E (G), is defined as the sum of absolute values of the eigenvalues
of its adjacency matrix. In Akbari and Hosseinzadeh (2020)[3] it was conjectured that for …

New Bounds on the Energy of Graphs with Self–Loops 1 Introduction Page 1 MATCH
Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput …

Let $ G $ be a graph of order $ n $ with eigenvalues $\lambda _ {1}\geq\lambda_
{2}\geq\cdots\geq\lambda _ {n}. $ The energy of $ G $ is defined as $ E\left (G\right)=\sum …

Let G be a graph with n vertices and m edges. A vertex cover of G is a set Q of vertices that
contains one endpoint of every edge; the minimum cardinality of a vertex cover is called the …

Let $ G $ be a graph of order $ n $ with adjacency matrix $ A (G) $. The\textit {energy} of
graph $ G $, denoted by $\mathcal {E}(G) $, is defined as the sum of absolute value of …

The energy of a graph $ G $, denoted by $\mathcal {E}(G) $, is defined as the sum of
absolute values of all eigenvalues of $ G $. A graph $ G $ is called reciprocal if $\frac …

Let G be a graph of order n, and let Δ (G), δ (G) and d¯ be the maximum, minimum and
average degrees of G, respectively. In 2020, Akbari and Hosseinzadeh proposed a …