Extremal values of ratios: distance problems vs. subtree problems in trees. II
From MaRDI portal
Publication:2436831
DOI10.1016/j.disc.2013.12.027zbMath1283.05059OpenAlexW2028431563MaRDI QIDQ2436831
Publication date: 27 February 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.12.027
Related Items
On the eccentric subtree number in trees ⋮ Eccentricity sums in trees ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ 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 ⋮ Trees with large numbers of subtrees ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
Cites Work
This page was built for publication: Extremal values of ratios: distance problems vs. subtree problems in trees. II
