The following pages link to Maximizing the mean subtree order (Q5229538):
Displayed 20 items.
- 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 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)
- On the roots of the subtree polynomial (Q2198997) (← links)
- A lower bound on the average size of a connected vertex set of a graph (Q2664553) (← links)
- On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← 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)
- 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)