Extremal values of ratios: distance problems vs. subtree problems in trees
From MaRDI portal
Publication:1953459
zbMath1266.05012MaRDI QIDQ1953459
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p67
centerbinary treeextremal problemscaterpillarWiener indexcentroidstar treesubtree coredistances in treesgood binary treesubtrees of trees
Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (7)
On the eccentric subtree number in trees ⋮ Eccentricity sums in trees ⋮ Extremal values of ratios: distance problems vs. subtree problems in trees. II ⋮ The number of subtrees in graphs with given number of cut edges ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ The distances between internal vertices and leaves of a tree
This page was built for publication: Extremal values of ratios: distance problems vs. subtree problems in trees
