Pages that link to "Item:Q5958835"
From MaRDI portal
The following pages link to Minimum connected dominating sets of random cubic graphs (Q5958835):
Displaying 6 items.
- Minimum connected dominating sets in finite graphs (Q712285) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Q1026103) (← links)
- Minimum independent dominating sets of random cubic graphs (Q4803314) (← links)
- The dominating number of a random cubic graph (Q4851928) (← links)
- Randomized greedy algorithms for finding smallk-dominating sets of regular graphs (Q5704842) (← links)