The following pages link to On subtrees of trees (Q1775731):
Displaying 50 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- Greedy trees, subtrees and antichains (Q396846) (← links)
- Efficient mining for structurally diverse subgraph patterns in large molecular databases (Q413872) (← links)
- The minimal number of subtrees of a tree (Q489363) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- Extremal problems for trees with given segment sequence (Q507572) (← links)
- The sum of the distances between the leaves of a tree and the `semi-regular' property (Q539876) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- On the eccentric subtree number in trees (Q827611) (← links)
- Enumeration of subtrees of trees (Q861266) (← links)
- Binary trees with the largest number of subtrees (Q868393) (← links)
- The extremal values of the Wiener index of a tree with given degree sequence (Q948686) (← links)
- The inverse problem for certain tree parameters (Q967387) (← links)
- On different ``middle parts'' of a tree (Q1658760) (← links)
- The shape of node reliability (Q1701111) (← links)
- Maximizing distance between center, centroid and subtree core of trees (Q1713074) (← links)
- The minimum asymptotic density of binary caterpillars (Q1733879) (← links)
- On subtrees of trees (Q1775731) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
- On the coefficients of the independence polynomial of graphs (Q2012888) (← links)
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs (Q2035665) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- On the maximum mean subtree order of trees (Q2048363) (← links)
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees (Q2057597) (← links)
- A conjecture on different central parts of binary trees (Q2102762) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- Trees with minimum number of infima closed sets (Q2113344) (← links)
- Enumeration of subtrees of planar two-tree networks (Q2168574) (← links)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees (Q2169441) (← links)
- Maximum number of subtrees in cacti and block graphs (Q2172841) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
- Extremal trees with fixed degree sequence (Q2223451) (← links)
- The number of subtrees in graphs with given number of cut edges (Q2231772) (← links)
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
- On the number of connected subgraphs of graphs (Q2243091) (← links)
- Location of speed-up subnetworks (Q2259045) (← links)
- Sub-trees of a random tree (Q2274085) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- On \(\alpha \)-greedy expansions of numbers (Q2381829) (← links)
- Enumeration problems for classes of self-similar graphs (Q2384571) (← links)
- Extremal values of ratios: distance problems vs. subtree problems in trees. II (Q2436831) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
- Least central subtrees, center, and centroid of a tree (Q3087617) (← links)
- The number of subtrees of trees with given diameter (Q4603866) (← links)
- On the Number of Nonisomorphic Subtrees of a Tree (Q4604018) (← links)
