Some extremal ratios of the distance and subtree problems in binary trees
From MaRDI portal
Publication:2279596
DOI10.1016/J.AMC.2019.05.023zbMath1428.05057arXiv1712.00695OpenAlexW2963963481WikidataQ127744759 ScholiaQ127744759MaRDI QIDQ2279596
Shujing Wang, Hua Wang, Shuchao Li
Publication date: 13 December 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.00695
Related Items (4)
Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ On subtree number index of generalized book graphs, fan graphs, and wheel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Wiener maximum quadratic assignment problem
- Binary trees with the largest number of subtrees
- 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
- Sum of weighted distances in trees
- On subtrees of trees
- Superdominance order and distance of trees with bounded maximum degree
- 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
- Vertex-based and edge-based centroids of graphs
- On distances in vertex-weighted trees
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- 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
This page was built for publication: Some extremal ratios of the distance and subtree problems in binary trees