Nov 15, 2019 · A challenging problem is to find extremal values of the ratios between graph indices and corresponding local functions at middle parts or leaves.

Nov 15, 2019 · The sum of distances between vertices in a graph G σ ( G ) = ∑ u , v ∈ V ( G ) d G ( u , v ) , where dG(u, v) is the distance between u and v in ...

Such extremal ratios, along with the extremal structures, were studied and compared for the distance and subtree problems for general trees In this paper this ...

Such extremal ratios, along with the extremal structures, were studied and compared for the distance and subtree problems for general trees In this paper this ...

Dive into the research topics of 'Some extremal ratios of the distance and subtree problems in binary trees'. Together they form a unique fingerprint. Sort by ...

subtree problems in trees. Extremal values of ratios: distance problems vs. subtree problems ... some ... (We also solved exactly Knudsen's original problem, namely ...

Some extremal ratios of the distance and subtree problems in binary trees. https://doi.org/10.1016/j.amc.2019.05.023 · Full text. Journal: Applied Mathematics ...

Some extremal ratios of the distance and subtree problems in binary trees · On the eccentric subtree number in trees · On σ-span and F-span of trees and full ...

Apr 22, 2024 · Some extremal ratios of the distance and subtree problems in binary trees. Article. Dec 2017; APPL MATH COMPUT. Shuchao Li · Hua Wang ...

Dec 28, 2012 · In this paper we test how far the negative correlation between distances and subtrees go if we look for the extremal values of FT (w)/FT (u), FT ...