Pages that link to "Item:Q2409527"
From MaRDI portal
The following pages link to On 2-step and hop dominating sets in graphs (Q2409527):
Displaying 10 items.
- On total domination and hop domination in diamond-free graphs (Q2305660) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- On the complexity of some hop domination parameters (Q5009934) (← links)
- Double hop dominating sets in graphs (Q5025128) (← links)
- ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES (Q5068502) (← links)
- (Q5074499) (← links)
- On neighborhood graphs: Domination, coloring and other properties (Q5083853) (← links)
- On Hop Roman Domination in Trees (Q5242950) (← links)
