The sum of the distances between the leaves of a tree and the `semi-regular' property

DOI10.1016/j.disc.2010.06.005zbMath1222.05027WikidataQ42652827 ScholiaQ42652827MaRDI QIDQ539876

László A. Székely, Hua Wang, Taoyang Wu

Publication date: 31 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.005

zbMATH Keywords

tree; distance; Wiener index; leaves; TBR operation

Mathematics Subject Classification ID

05C05: Trees

05C12: Distance in graphs

Related Items

Generalizations of Wiener polarity index and terminal Wiener index, Greedy trees, subtrees and antichains, The minimal number of subtrees with a given degree sequence, Rooted tree statistics from Matula numbers, The distances between internal vertices and leaves of a tree, The terminal Hosoya polynomial of some families of composite graphs, Terminal Hosoya polynomial of line graphs, Centroid, leaf-centroid, and internal-centroid, Spectral moments of trees with given degree sequence

Cites Work

• Unnamed Item
• Unnamed Item
• The extremal values of the Wiener index of a tree with given degree sequence
• A note on trees of maximum weight and restricted degrees
• Wiener index versus maximum degree in trees
• On subtrees of trees
• Superdominance order and distance of trees with bounded maximum degree
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Correlation of Graph‐Theoretical Indices
• On the Randić index
• Subtree transfer operations and their induced metrics on evolutionary trees
• Wiener index of trees: Theory and applications