The distances between internal vertices and leaves of a tree
From MaRDI portal
Publication:740265
DOI10.1016/j.ejc.2014.03.014zbMath1300.05087OpenAlexW2027915973MaRDI QIDQ740265
Publication date: 2 September 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.03.014
Related Items
On the eccentric subtree number in trees ⋮ The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains ⋮ Eccentricity sums in trees ⋮ Peripheral Wiener index of trees and related questions ⋮ Sum of weighted distances in trees ⋮ Variations of the eccentricity and their properties in trees ⋮ Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimal number of subtrees of a tree
- The minimal number of subtrees with a given degree sequence
- The sum of the distances between the leaves of a tree and the `semi-regular' property
- The Wiener maximum quadratic assignment problem
- Terminal Wiener index
- The extremal values of the Wiener index of a tree with given degree sequence
- Extremal values for ratios of distances in trees
- Wiener index versus maximum degree in trees
- On subtrees of trees
- Trees with the mos subtrees - an algorithmic approach
- Optimal trees for functions of internal distance
- Extremal values of ratios: distance problems vs. subtree problems in trees
- Centroid, leaf-centroid, and internal-centroid
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- The Maximum Wiener Index of Trees with Given Degree Sequences
- The Number of Subtrees of Trees with Given Degree Sequence
- Correlation of Graph‐Theoretical Indices
- Wiener index of trees: Theory and applications
This page was built for publication: The distances between internal vertices and leaves of a tree
