On \(\sigma\)-span and \(F\)-span of trees and full binary trees
From MaRDI portal
Publication:1999724
DOI10.1016/j.disc.2019.02.012zbMath1414.05078OpenAlexW2921376823MaRDI QIDQ1999724
Shujing Wang, Hua Wang, Shuchao Li
Publication date: 27 June 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.02.012
Related Items
Which numbers are status differences?, Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary trees with the largest number of subtrees
- Corrigendum: 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
- Superdominance order and distance of trees with bounded maximum degree
- On the Steiner median of a tree
- Trees with the mos subtrees - an algorithmic approach
- Further analysis on the total number of subtrees of trees
- Extremal values of ratios: distance problems vs. subtree problems in trees
- Some extremal ratios of the distance and subtree problems in binary trees
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Least central subtrees, center, and centroid of a tree
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Centers to centroids in graphs
- Distance in graphs
- 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
