The extremal values of the Wiener index of a tree with given degree sequence
From MaRDI portal
Publication:948686
DOI10.1016/j.dam.2007.11.005zbMath1155.05020arXiv0709.1679MaRDI QIDQ948686
Publication date: 17 October 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.1679
05C05: Trees
05C35: Extremal problems in graph theory
05C12: Distance in graphs
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05C07: Vertex degrees
Related Items
The number of subtrees of trees with given diameter, The Number of Subtrees of Trees with Given Degree Sequence, On a family of trees with minimal atom-bond connectivity index, Eccentricity sums in trees, Greedy trees, subtrees and antichains, Functions on adjacent vertex degrees of trees with given degree sequence, On the maximal Wiener index and related questions, The minimal number of subtrees of a tree, The minimal number of subtrees with a given degree sequence, Ordering trees with given matching number by their Wiener indices, The sum of the distances between the leaves of a tree and the `semi-regular' property, On the variable Wiener indices of trees with given maximum degree, The Wiener maximum quadratic assignment problem, The distances between internal vertices and leaves of a tree, Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence, On the \(k\)th smallest and \(k\)th greatest modified Wiener indices of trees, On different ``middle parts of a tree, On the ABC index of connected graphs with given degree sequences, Comparison between the Szeged index and the eccentric connectivity index, On maximum Wiener index of trees and graphs with given radius, Spectral moments of trees with given degree sequence, Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees, On the graph of nilpotent matrix group of length one
Cites Work
