On majorization of closed walk vectors of trees with given degree sequences

DOI10.1016/j.amc.2018.05.007zbMath1427.05130arXiv1806.00789OpenAlexW2803606028MaRDI QIDQ2335614

Ya-Lei Jin, Daniel Gray, Xiao Dong Zhang, Ya-Hong Chen

Publication date: 14 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

treesmajorizationdegree sequenceclosed walk

Mathematics Subject Classification ID

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

Related Items (1)

Extremal trees with fixed degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequalities for the number of walks in graphs
• The minimal number of subtrees with a given degree sequence
• On a poset of trees
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• 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
• Spectral moments of trees with given degree sequence
• Walks and paths in trees
• The Number of Subtrees of Trees with Given Degree Sequence
• Inequalities: theory of majorization and its applications
• The dense \(k\)-subgraph problem

This page was built for publication: On majorization of closed walk vectors of trees with given degree sequences