Pages that link to "Item:Q6081554"

The following pages link to The number and average size of connected sets in graphs with degree constraints (Q6081554):

Displaying 10 items.

• Bounds on the average connectivity of a graph (Q1406026) (← links)
• On the number of connected sets in bounded degree graphs (Q1627210) (← links)
• The average size of independent sets of graphs (Q2181915) (← 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 Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
• The average size of a connected vertex set of a graph—Explicit formulas and open problems (Q6055930) (← links)
• Extremal problems for connected set enumeration (Q6094711) (← 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)