Abstract
Let be a graph of order with adjacency matrix . The \textit{energy} of graph , denoted by , is defined as the sum of absolute value of eigenvalues of . It was conjectured that if is non-singular, then . In this paper we propose a stronger conjecture as for , , where is the average degree of . Here, we show that conjecture holds for bipartite graphs, planar graphs and for the graphs with
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.