Wiener index versus maximum degree in trees

From MaRDI portal
Revision as of 04:03, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)



Related Items

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



Cites Work