The following pages link to The diversity of domination (Q1356420):
Displaying 9 items.
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
