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, Unnamed Item, Steiner Wiener index of block graphs, Unnamed Item, Wiener index in graphs with given minimum degree and maximum degree, Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs, Wiener index of graphs with fixed number of pendant or cut-vertices, Extremal trees with respect to the Steiner Wiener index, 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, Subtrees of spiro and polyphenyl hexagonal chains, Split sizes and extremal tree shapes, The distances between internal vertices and leaves of a tree, On the extremal values of the eccentric distance sum of trees with a given maximum degree, On the eccentric subtree number in trees, 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, Sum of weighted distances in trees, Maximum external Wiener index of graphs, Maximizing Wiener index for trees with given vertex weight and degree sequences, The Steiner Wiener index of trees with a given segment sequence, Proof of a conjecture on the Wiener index of Eulerian graphs, Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity, On two conjectures concerning trees with maximal inverse sum indeg index, Extremal trees with fixed degree sequence, Extreme Wiener indices of trees with given number of vertices of maximum degree, Some extremal ratios of the distance and subtree problems in binary trees, On the distance spectral radius of trees with given degree sequence, Extremal cover cost and reverse cover cost of trees with given segment sequence, On distances in vertex-weighted trees, On majorization of closed walk vectors of trees 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, The evolution of the structure of ABC-minimal trees, Minimum status of trees with a given degree sequence, On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs, On the graph of nilpotent matrix group of length one, Wiener-type indices of Parikh word representable graphs
Cites Work