The following pages link to Hop domination in graphs. II (Q2806683):
Displaying 21 items.
- Bounds on the hop domination number of a tree (Q902254) (← links)
- On total domination and hop domination in diamond-free graphs (Q2305660) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- On 2-step and hop dominating sets in graphs (Q2409527) (← links)
- Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths (Q2419091) (← links)
- Connected hop domination in graphs under some binary operations (Q4556422) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- CONNECTED PERFECT HOP DOMINATING SETS UNDER SOME BINARY OPERATIONS (Q4973442) (← 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)
- The geodetic hop domination number of complementary prisms (Q5025156) (← links)
- Hop domination polynomial of graphs (Q5034561) (← links)
- Clone hop domination number of a graph (Q5036670) (← links)
- ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES (Q5068502) (← links)
- (Q5074499) (← links)
- THE FORCING HOP DOMINATION NUMBER OF A GRAPH (Q5075602) (← links)
- On Hop Roman Domination in Trees (Q5242950) (← links)
- Hop total Roman domination in graphs (Q6166240) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)
- Further results on the hop domination number of a graph (Q6596812) (← links)
