Pages that link to "Item:Q6055400"

The following pages link to On the mean subtree order of graphs under edge addition (Q6055400):

Displaying 9 items.

• On the average order of a dominating set of a forest (Q2092347) (← links)
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
• On the probability that a random subtree is spanning (Q6056779) (← links)
• The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
• Extremal graphs for average sizes of maximal matchings (Q6069175) (← 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)