Pages that link to "Item:Q2664553"

The following pages link to A lower bound on the average size of a connected vertex set of a graph (Q2664553):

Displaying 13 items.

• Extremal results on average subtree density of series-reduced trees (Q403359) (← links)
• Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
• Bounds on the average connectivity of a graph (Q1406026) (← links)
• The average size of a connected vertex set of a \(k\)-connected graph (Q2043391) (← links)
• The path minimises the average size of a connected induced subgraph (Q2113349) (← links)
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees (Q2692183) (← links)
• On the Average (Edge-)Connectivity of Minimally $k$-(Edge-)Connected Graphs (Q5032440) (← links)
• On the mean subtree order of trees under edge contraction (Q6046687) (← links)
• The average size of a connected vertex set of a graph—Explicit formulas and open problems (Q6055930) (← 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)
• Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)
• A tight upper bound on the average order of dominating sets of a graph (Q6642500) (← links)