On the maximal Wiener index and related questions

DOI10.1016/j.dam.2012.03.002zbMath1243.05075OpenAlexW2091144094MaRDI QIDQ427906

Andrew V. Sills, Hua Wang

Publication date: 18 June 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.002

zbMATH Keywords

treeWiener indexdegree sequence

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Abstract computational complexity for mathematical programming problems (90C60) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (8)

On the eccentric subtree number in trees ⋮ A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Sum of weighted distances in trees ⋮ The minimal number of subtrees of a tree ⋮ Extreme Wiener indices of trees with given number of vertices of maximum degree ⋮ Graphs with a given diameter that maximise the Wiener index ⋮ Wiener index of Eulerian graphs ⋮ On distances in vertex-weighted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Wiener maximum quadratic assignment problem
• 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
• Wiener index versus maximum degree in trees
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Wiener index of trees: Theory and applications

This page was built for publication: On the maximal Wiener index and related questions