Spectral moments of trees with given degree sequence

From MaRDI portal
Publication:2435586



Abstract: Let lambda1,dots,lambdan be the eigenvalues of a graph G. For any kgeq0, the k-th spectral moment of G is defined by Mk(G)=lambda1k+dots+lambdank. We use the fact that Mk(G) is also the number of closed walks of length k in G to show that among trees T whose degree sequence is D or majorized by D, Mk(T) is maximized by the greedy tree with degree sequence D (constructed by assigning the highest degree in D to the root, the second-, third-, dots highest degrees to the neighbors of the root, and so on) for any kgeq0. Several corollaries follow, in particular a conjecture of Ili'c and Stevanovi'c on trees with given maximum degree, which in turn implies a conjecture of Gutman, Furtula, Markovi'c and Gliv{s}i'c on the Estrada index of such trees, which is defined as EE(G)=elambda1+dots+elambdan.












This page was built for publication: Spectral moments of trees with given degree sequence

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