On subtrees of trees
From MaRDI portal
Publication:1775731
DOI10.1016/j.aam.2004.07.002zbMath1153.05019OpenAlexW1998411156MaRDI 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 indexBinary treeTreeCenterCaterpillarCentroidMultiple parsimony alignment with affine gap costNumber of subtreesSubtree core
Related Items
Maximising the number of connected induced subgraphs of unicyclic graphs ⋮ Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ Different central parts of trees and their pairwise distances ⋮ On the eccentric subtree number in trees ⋮ Generating and enumerating digitally convex sets of trees ⋮ On \(\alpha \)-greedy expansions of numbers ⋮ Enumeration problems for classes of self-similar graphs ⋮ Enumeration of subtrees of trees ⋮ On different ``middle parts of a tree ⋮ Binary trees with the largest number of subtrees ⋮ Enumeration of subtrees of planar two-tree networks ⋮ On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees ⋮ The Number of Subtrees of Trees with Given Degree Sequence ⋮ Maximum number of subtrees in cacti and block graphs ⋮ Greedy trees, subtrees and antichains ⋮ On the mean subtree order of trees under edge contraction ⋮ 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 ⋮ Extremal problems for connected set enumeration ⋮ Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm ⋮ Efficient mining for structurally diverse subgraph patterns in large molecular databases ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ The shape of node reliability ⋮ The number of subtrees of trees with given diameter ⋮ On the Number of Nonisomorphic Subtrees of a Tree ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees ⋮ Extremal values of ratios: distance problems vs. subtree problems in trees. II ⋮ Maximizing distance between center, centroid and subtree core of trees ⋮ Extremal trees with fixed degree sequence ⋮ The minimum asymptotic density of binary caterpillars ⋮ The minimal number of subtrees of a tree ⋮ The minimal number of subtrees with a given degree sequence ⋮ 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 ⋮ The extremal values of the Wiener index of a tree with given degree sequence ⋮ Extremal problems for trees with given segment sequence ⋮ On the number of connected subgraphs of graphs ⋮ 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 ⋮ The inverse problem for certain tree parameters ⋮ The sum of the distances between the leaves of a tree and the `semi-regular' property ⋮ Location of speed-up subnetworks ⋮ On the coefficients of the independence polynomial of graphs ⋮ On subtrees of trees ⋮ Sub-trees of a random tree ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ On the Position Value for Special Classes of Networks ⋮ 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 ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ The distances between internal vertices and leaves of a tree ⋮ On the maximum mean subtree order of trees ⋮ Least central subtrees, center, and centroid of a tree ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ A conjecture on different central parts of binary trees ⋮ Enumeration of BC-subtrees of trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ Trees with minimum number of infima closed sets ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
Cites Work
This page was built for publication: On subtrees of trees
