Spectral moments of trees with given degree sequence

DOI10.1016/j.laa.2013.10.019zbMath1282.05027arXiv1304.4696MaRDI QIDQ2435586

Eric Ould Dadah Andriantiana, Stephan G. Wagner

Publication date: 19 February 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.4696

zbMATH Keywords

spectral moments; trees; degree sequence; Estrada index; walks

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Spectral Radius of Graphs, Unnamed Item, An alternative proof of the Sombor index minimizing property of greedy trees, Extremal problems for trees with given segment sequence, Ordering starlike trees by the totality of their spectral moments, Extremal trees with fixed degree sequence, On majorization of closed walk vectors of trees with given degree sequences, On spectral radius of graphs with pendant paths, Complete subgraphs in connected graphs and its application to spectral moment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy trees, subtrees and antichains
• The Estrada index of unicyclic graphs
• On maximum Estrada indices of graphs with given parameters
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• The Estrada index of trees
• On Estrada index of trees
• The Estrada index of chemical trees
• The Laplacian spectral radii of trees with degree sequences
• The extremal values of the Wiener index of a tree with given degree sequence
• Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
• Graphs with given degree sequence and maximal spectral radius
• Wiener index versus maximum degree in trees
• Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
• Estimating the Estrada index
• Graph Energy
• On the Estrada index of graphs with given number of cut edges
• Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
• The Number of Subtrees of Trees with Given Degree Sequence