Locating-hop domination in graphs
From MaRDI portal
(Redirected from Locating-hop domination in graphs)
Recommendations
Cites work
- A note on non-dominating set partitions in graphs
- Bounds on the hop domination number of a tree
- Connected hop domination in graphs under some binary operations
- Dierentiating-Dominating sets in graphs Under binary operations
- Domination and location in acyclic graphs
- Hop domination in graphs. II
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 4103125 (Why is no real title available?)
- scientific article; zbMATH DE number 1735664 (Why is no real title available?)
- Locating and total dominating sets in trees
- On 2-step and hop dominating sets in graphs
Cited in
(11)- A note on the complexity of locating-total domination in graphs
- Hop domination in graphs. II
- Connected hop domination in graphs under some binary operations
- Connected perfect hop dominating sets under some binary operations
- Double hop dominating sets in graphs
- Clone hop domination number of a graph
- On hop domination number of some generalized graph structures
- Total hop dominating sets in the join, corona and lexicographic product of graphs
- Graphs with small and large hop domination numbers
- Certified hop domination in graphs
- Bounds on the hop domination number of a tree
This page was built for publication: Locating-hop domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074499)
