Pages that link to "Item:Q1656909"
From MaRDI portal
The following pages link to Making a dominating set of a graph connected (Q1656909):
Displaying 10 items.
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Some results on characterizing the edges of connected graphs with a given domination number (Q1893172) (← links)
- A proof of a conjecture on the connected domination number (Q2091175) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- 2-(edge-)connected edge domination number and matching number (Q2698534) (← links)
- 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)