Abstract
The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the graph. In this paper, we present a new method to compare the energies of two -subdivision bipartite graphs on some cut edges. As the applications of this new method, we determine the first largest energy trees of order for , and we also give a simplified proof of the conjecture on the fourth maximal energy tree.
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.