Abstract
We prove that, for any graph , its graph energy is at least twice the Randic index. We show that equality holds if and only if is the union of complete bipartite graphs.
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.