Pages that link to "Item:Q3466362"

The following pages link to On the Local and Global Means of Subtree Orders (Q3466362):

Displaying 29 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 enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← 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)
• The average order of dominating sets of a graph (Q2231709) (← 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)
• Local greatest equivalence classes of \(\omega\)-trees (Q2884206) (← links)
• The mean order of sub‐<i>k</i>‐trees of <i>k</i>‐trees (Q4575518) (← links)
• The number of subtrees of trees with given diameter (Q4603866) (← links)
• On the Mean Connected Induced Subgraph Order of Cographs (Q4616101) (← links)
• Maximizing the mean subtree order (Q5229538) (← 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)
• Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)
• On the maximum local mean order of sub-\(k\)-trees of a \(k\)-tree (Q6606327) (← links)
• On the difference of mean subtree orders under edge contraction (Q6615748) (← links)
• A tight upper bound on the average order of dominating sets of a graph (Q6642500) (← links)