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

Authors Hai-Ying Shan, Jia-Yu Shao, Li Zhang, Changxiang He

Publication date 8 November 2011

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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

k

-subdivision bipartite graphs on some cut edges. As the applications of this new method, we determine the first

l f l o o r f r a c n - 7 2 f l o o r

largest energy trees of order

n

for

n g e 31

, and we also give a simplified proof of the conjecture on the fourth maximal energy tree.

This page was built for publication: A series of trees with the first $\lfloor\frac{n-7}{2}\rfloor$ largest energies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6228904)