A series of trees with the first ⌊n−72⌋\lfloor\frac{n-7}{2}\rfloor largest energies

preprint2011arXivOpen access

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 kk-subdivision bipartite graphs on some cut edges. As the applications of this new method, we determine the first ⌊n−72⌋\lfloor\frac{n-7}{2}\rfloor largest energy trees of order nn for n≥31n\ge 31, and we also give a simplified proof of the conjecture on the fourth maximal energy tree.

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.