Bounds for the energy of graphs
S Filipovski, R Jajcay - Mathematics, 2021 - mdpi.com
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 …
degree δ (G). Let A be the adjacency matrix of G, and let λ 1≥ λ 2≥…≥ λ n be the …
Energy of graphs with no eigenvalue in the interval (− 1, 1)
MR Oboudi - Linear Algebra and its Applications, 2024 - Elsevier
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 …
1,…, λ n are the eigenvalues of G. Recently, it has been conjectured that if all eigenvalues of …
[PDF][PDF] New upper bounds on the energy of a graph
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) …
Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 90 (2023) …
On the energy of line graphs
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 …
of its adjacency matrix. In Akbari and Hosseinzadeh (2020)[3] it was conjectured that for …
[PDF][PDF] New Bounds on the Energy of Graphs with Self–Loops
J Liu, Y Chen, D Dimitrov, J Chen - … IN MATHEMATICAL AND IN …, 2024 - match.pmf.kg.ac.rs
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 …
Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput …
Remarks on the bounds of graph energy
ŞB Bozkurt Altındağ, E Milovanović… - Communications in …, 2024 - comb-opt.azaruniv.ac.ir
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 …
{2}\geq\cdots\geq\lambda _ {n}. $ The energy of $ G $ is defined as $ E\left (G\right)=\sum …
[PDF][PDF] Lower Bounds on the Vertex Cover Number and Energy of Graphs
F Shaveisi - MATCH-COMMUNICATIONS IN MATHEMATICAL …, 2022 - match.pmf.kg.ac.rs
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 …
contains one endpoint of every edge; the minimum cardinality of a vertex cover is called the …
A lower bound of the energy of non-singular graphs in terms of average degree
S Akbari, H Dabirian, SM Ghasemi - arXiv preprint arXiv:2207.04599, 2022 - arxiv.org
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 …
graph $ G $, denoted by $\mathcal {E}(G) $, is defined as the sum of absolute value of …
Energy of strong reciprocal graphs
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 …
absolute values of all eigenvalues of $ G $. A graph $ G $ is called reciprocal if $\frac …
Validity of Akbari's Energy Conjecture for Threshold Graphs
X Li, Z Wang - Bulletin of the Malaysian Mathematical Sciences …, 2022 - Springer
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 …
average degrees of G, respectively. In 2020, Akbari and Hosseinzadeh proposed a …