The Maximum Wiener Index of Trees with Given Degree Sequences
From MaRDI portal
Publication:4899904
zbMath1265.05213arXiv0907.3772MaRDI QIDQ4899904
Min-Xian Han, Yong Liu, Xiao Dong Zhang
Publication date: 10 January 2013
Full work available at URL: https://arxiv.org/abs/0907.3772
Related Items (33)
On the eccentric subtree number in trees ⋮ Peripheral Wiener index of trees and related questions ⋮ On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index ⋮ The Number of Subtrees of Trees with Given Degree Sequence ⋮ On extremal cacti with respect to the revised Szeged index ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Wiener index of iterated line graphs of trees homeomorphic to \(H\) ⋮ On the maximal Wiener index and related questions ⋮ On the sum of the squares of all distances in bipartite graphs with given connectivity ⋮ Q-Wiener index of some compound trees ⋮ On the sum of all distances in bipartite graphs ⋮ Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees ⋮ Sum of weighted distances in trees ⋮ The minimal number of subtrees of a tree ⋮ The minimal number of subtrees with a given degree sequence ⋮ Extreme Wiener indices of trees with given number of vertices of maximum degree ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Note on extremal graphs with given matching number ⋮ On extremal cacti with respect to the Szeged index ⋮ Ordering trees with given matching number by their Wiener indices ⋮ The largest Wiener index of unicyclic graphs given girth or maximum degree ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence ⋮ The Steiner Wiener index of trees with a given segment sequence ⋮ Graphs with a given diameter that maximise the Wiener index ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Extremal trees with respect to the Steiner Wiener index ⋮ The distances between internal vertices and leaves of a tree ⋮ Extremal cover cost and reverse cover cost of trees with given segment sequence ⋮ On the edge-Szeged index of unicyclic graphs with perfect matchings ⋮ On distances in vertex-weighted trees ⋮ Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
This page was built for publication: The Maximum Wiener Index of Trees with Given Degree Sequences
