Pages that link to "Item:Q6081554"
From MaRDI portal
The following pages link to The number and average size of connected sets in graphs with degree constraints (Q6081554):
Displaying 5 items.
- 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)
- 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)
