Wiener index versus maximum degree in trees

From MaRDI portal
Publication:1613418


DOI10.1016/S0166-218X(01)00357-2zbMath0993.05061MaRDI QIDQ1613418

Miranca Fischermann, Dieter Rautenbach, Arne Hoffmann, Lutz Volkmann, László A. Székely

Publication date: 29 August 2002

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


05C05: Trees

05C35: Extremal problems in graph theory

05C12: Distance in graphs


Related Items

Wiener Index and Remoteness in Triangulations and Quadrangulations, Unnamed Item, Unnamed Item, Wiener index in graphs with given minimum degree and maximum degree, Extremal trees with respect to the Steiner Wiener index, Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree, Eccentric connectivity index of graphs with subdivided edges, On the maximal Wiener index and related questions, The minimal number of subtrees of a tree, Ordering trees with given matching number by their Wiener indices, The largest Wiener index of unicyclic graphs given girth or maximum degree, The sum of the distances between the leaves of a tree and the `semi-regular' property, On the number of independent subsets in trees with restricted degrees, The eccentric connectivity index of nanotubes and nanotori, 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, On the extremal values of the eccentric distance sum of trees with a given maximum degree, On the eccentric subtree number in trees, The maximum Wiener index of maximal planar graphs, The Estrada index of chemical trees, Stability in the self-organized evolution of networks, Binary trees with the largest number of subtrees, Wiener indices of balanced binary trees, The extremal values of the Wiener index of a tree with given degree sequence, Wiener index of graphs with more than one cut-vertex, The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices, Sum of weighted distances in trees, The minimum asymptotic density of binary caterpillars, Maximizing Wiener index for trees with given vertex weight and degree sequences, The minimum Wiener index of unicyclic graphs with a fixed diameter, On subtrees of trees, Superdominance order and distance of trees with bounded maximum degree, On \(\sigma\)-span and \(F\)-span of trees and full binary trees, A note on extremal trees with degree conditions, The Steiner Wiener index of trees with a given segment sequence, Graphs with a given diameter that maximise the Wiener index, Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost, Proof of a conjecture on the Wiener index of Eulerian graphs, On the minimum Kirchhoff index of unicyclic graphs with given girth and diameter, Wiener index of quadrangulation graphs, Extremal trees with fixed degree sequence, Ordering trees with given pendent vertices with respect to Merrifield-Simmons indices and Hosoya indices, 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, On maximum Wiener index of trees and graphs with given radius, The ancestral matrix of a rooted tree, Spectral moments of trees with given degree sequence, On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs, Trees with given maximum degree minimizing the spectral radius, Further Results on Two Families of Nanostructures, On Wiener and terminal Wiener index of graphs



Cites Work