Pages that link to "Item:Q1656909"
From MaRDI portal
The following pages link to Making a dominating set of a graph connected (Q1656909):
Displaying 5 items.
- Connected Domination (Q3384607) (← links)
- How to make a strongly connected digraph two-connected (Q5101433) (← links)
- Connected domination in random graphs (Q6107484) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
- The extended dominating sets in graphs (Q6542990) (← links)