On subtrees of trees
From MaRDI portal
Publication:1775731
DOI10.1016/j.aam.2004.07.002zbMath1153.05019MaRDI QIDQ1775731
Publication date: 4 May 2005
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2004.07.002
Wiener index; Binary tree; Tree; Center; Caterpillar; Centroid; Multiple parsimony alignment with affine gap cost; Number of subtrees; Subtree core
05C05: Trees
Related Items
The number of subtrees of trees with given diameter, On the Number of Nonisomorphic Subtrees of a Tree, On the Position Value for Special Classes of Networks, The Number of Subtrees of Trees with Given Degree Sequence, Trees with large numbers of subtrees, On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees, On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs, Generating and enumerating digitally convex sets of trees, Greedy trees, subtrees and antichains, Efficient mining for structurally diverse subgraph patterns in large molecular databases, The minimal number of subtrees of a tree, The minimal number of subtrees with a given degree sequence, Extremal problems for trees with given segment sequence, The sum of the distances between the leaves of a tree and the `semi-regular' property, Subtrees of spiro and polyphenyl hexagonal chains, The distances between internal vertices and leaves of a tree, Enumeration of subtrees of trees, Binary trees with the largest number of subtrees, The extremal values of the Wiener index of a tree with given degree sequence, The inverse problem for certain tree parameters, On different ``middle parts of a tree, The shape of node reliability, Maximizing distance between center, centroid and subtree core of trees, The minimum asymptotic density of binary caterpillars, On subtrees of trees, On \(\sigma\)-span and \(F\)-span of trees and full binary trees, On the coefficients of the independence polynomial of graphs, Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm, The expected subtree number index in random polyphenylene and spiro chains, Location of speed-up subnetworks, Sub-trees of a random tree, Some extremal ratios of the distance and subtree problems in binary trees, Enumeration of BC-subtrees of trees, On \(\alpha \)-greedy expansions of numbers, Enumeration problems for classes of self-similar graphs, Extremal values of ratios: distance problems vs. subtree problems in trees. II, Least central subtrees, center, and centroid of a tree
Cites Work
