Pages that link to "Item:Q965244"
From MaRDI portal
The following pages link to The average order of a subtree of a tree (Q965244):
Displayed 35 items.
- Greedy trees, subtrees and antichains (Q396846) (← links)
- Extremal results on average subtree density of series-reduced trees (Q403359) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- Subtrees of spiro and polyphenyl hexagonal chains (Q668150) (← links)
- On the eccentric subtree number in trees (Q827611) (← links)
- The average size of a connected vertex set of a \(k\)-connected graph (Q2043391) (← links)
- On the maximum mean subtree order of trees (Q2048363) (← links)
- On the average order of a dominating set of a forest (Q2092347) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- The path minimises the average size of a connected induced subgraph (Q2113349) (← links)
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees (Q2169441) (← links)
- The average size of matchings in graphs (Q2175789) (← links)
- The average size of independent sets of graphs (Q2181915) (← links)
- The expected subtree number index in random polyphenylene and spiro chains (Q2197461) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- The average order of dominating sets of a graph (Q2231709) (← links)
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- A lower bound on the average size of a connected vertex set of a graph (Q2664553) (← links)
- The ratio of the numbers of odd and even cycles in outerplanar graphs (Q2685320) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
- On the Local and Global Means of Subtree Orders (Q3466362) (← links)
- The number of subtrees of trees with given diameter (Q4603866) (← links)
- On the Mean Connected Induced Subgraph Order of Cographs (Q4616101) (← links)
- On the Mean Order of Connected Induced Subgraphs of Block Graphs (Q5109058) (← links)
- Central Limit Theorems for Additive Tree Parameters with Small Toll Functions (Q5364224) (← links)
- On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees (Q5737898) (← links)
- On the mean subtree order of trees under edge contraction (Q6046687) (← links)
- On the mean subtree order of graphs under edge addition (Q6055400) (← links)
- The average size of a connected vertex set of a graph—Explicit formulas and open problems (Q6055930) (← links)
- On the probability that a random subtree is spanning (Q6056779) (← links)
- Random subtrees and unimodal sequences in graphs (Q6080114) (← links)
- The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
- Solution to a conjecture on the mean subtree order of graphs under edge addition (Q6081580) (← links)
- Decreasing the mean subtree order by adding <i>k</i> edges (Q6144910) (← links)