The sum of the distances between the leaves of a tree and the `semi-regular' property
From MaRDI portal
Publication:539876
DOI10.1016/J.DISC.2010.06.005zbMATH Open1222.05027OpenAlexW2059450735WikidataQ42652827 ScholiaQ42652827MaRDI QIDQ539876FDOQ539876
Authors: 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
Recommendations
- Sums of distances between vertices/leaves in \(k\)-ary trees
- The distances between internal vertices and leaves of a tree
- The terminal Wiener index of trees with diameter or maximum degree.
- Variations of distance-based invariants of trees
- Extremal values of ratios: distance problems vs. subtree problems in trees
Cites Work
- Title not available (Why is that?)
- Subtree transfer operations and their induced metrics on evolutionary trees
- 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
- Wiener index of trees: Theory and applications
- The extremal values of the Wiener index of a tree with given degree sequence
- On the Randić index
- A note on trees of maximum weight and restricted degrees
- Correlation of Graph‐Theoretical Indices
- Sums of distances between vertices/leaves in \(k\)-ary trees
Cited In (22)
- Sum of weighted distances in trees
- On majorization of closed walk vectors of trees with given degree sequences
- The terminal Hosoya polynomial of some families of composite graphs
- On the balance of unrooted trees
- Extremal trees with fixed degree sequence
- Peripheral Wiener index of trees and related questions
- Note on extremal graphs with given matching number
- Spectral moments of trees with given degree sequence
- Greedy trees, subtrees and antichains
- The minimal number of subtrees with a given degree sequence
- Terminal Hosoya polynomial of line graphs
- Sums of distances between vertices/leaves in \(k\)-ary trees
- The distances between internal vertices and leaves of a tree
- Generalizations of Wiener polarity index and terminal Wiener index
- Cut and pendant vertices and the number of connected induced subgraphs of a graph
- QSPR analysis of certain distance based topological indices
- Centroid, leaf-centroid, and internal-centroid
- On the distance spectral radius of trees with given degree sequence
- Rooted tree statistics from Matula numbers
- Split sizes and extremal tree shapes
- Terminal status of vertices and terminal status connectivity indices of graphs with its applications to properties of cycloalkanes
- On the vertex-edge Wiener indices of thorn graphs
This page was built for publication: The sum of the distances between the leaves of a tree and the `semi-regular' property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539876)
