On the maximal Wiener index and related questions
From MaRDI portal
Publication:427906
DOI10.1016/j.dam.2012.03.002zbMath1243.05075MaRDI QIDQ427906
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
05C05: Trees
05C35: Extremal problems in graph theory
05C90: Applications of graph theory
90C60: Abstract computational complexity for mathematical programming problems
05C12: Distance in graphs
05C07: Vertex degrees
Related Items
The minimal number of subtrees of a tree, Wiener index of Eulerian graphs, 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, Graphs with a given diameter that maximise the Wiener index, Extreme Wiener indices of trees with given number of vertices of maximum degree, On distances in vertex-weighted trees
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item