A lower bound of the energy of non-singular graphs in terms of average degree

preprint2022arXivOpen access

Abstract

Let GG be a graph of order nn with adjacency matrix A(G)A(G). The \textit{energy} of graph GG, denoted by E(G)\mathcal{E}(G), is defined as the sum of absolute value of eigenvalues of A(G)A(G). It was conjectured that if A(G)A(G) is non-singular, then E(G)≥Δ(G)+δ(G)\mathcal{E}(G)\geqΔ(G)+δ(G). In this paper we propose a stronger conjecture as for n≥5n \geq 5, E(G)≥n−1+d\mathcal{E}(G)\geq n-1+ d, where dd is the average degree of GG. Here, we show that conjecture holds for bipartite graphs, planar graphs and for the graphs with d≤n−2ln⁡n−3d \leq n-2\ln n -3

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.