On the complexity of some hop domination parameters
From MaRDI portal
Publication:5009934
Recommendations
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Bounds on the hop domination number of a tree
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Hop domination in graphs. II
- On 2-step and hop dominating sets in graphs
- On the complexity of \(k\)-step and \(k\)-hop dominating sets in graphs
- Roman domination in graphs.
Cited in
(8)- Hop total Roman domination in graphs
- Graphs with large hop Roman domination number
- On the complexity of \(k\)-step and \(k\)-hop dominating sets in graphs
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- Further results on the hop domination number of a graph
- Algorithm and hardness results on hop domination in graphs
- On hop Roman domination in trees
- A new look at the concept of domination in hypergraphs
This page was built for publication: On the complexity of some hop domination parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009934)