Pages that link to "Item:Q796552"

The following pages link to Monotonicity of the mean order of subtrees (Q796552):

Displaying 29 items.

• Greedy trees, subtrees and antichains (Q396846) (← links)
• Alternating Whitney sums and matchings in trees. 1 (Q1105614) (← 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)
• 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 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)
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← 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)
• When bad things happen to good trees (Q2744569) (← links)
• On the Local and Global Means of Subtree Orders (Q3466362) (← links)
• On the Number of Nonisomorphic Subtrees of a Tree (Q4604018) (← links)
• On the Mean Connected Induced Subgraph Order of Cographs (Q4616101) (← links)
• Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs (Q5039404) (← links)
• Maximising the number of connected induced subgraphs of unicyclic graphs (Q5879474) (← 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)