Hardness results of global Roman domination in graphs
From MaRDI portal
Publication:831760
DOI10.1007/978-3-030-67899-9_39OpenAlexW3128085997MaRDI QIDQ831760FDOQ831760
Authors: B. S. Panda, Pooja Goyal 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_39
Recommendations
- Hardness results of global Roman domination in graphs
- Global Roman domination in graphs
- On the global Roman domination number in graphs
- Global total Roman domination in graphs
- Hardness and approximation results of Roman \{3\}-domination in graphs
- On roman, global and restrained domination in graphs
- Roman \(k\)-domination: hardness, approximation and parameterized results
- Algorithm and hardness results in double Roman domination of graphs
- On total Roman domination in graphs
- Hardness results of global total \(k\)-domination problem in graphs
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman domination in graphs.
- Roman domination on strongly chordal graphs
- Analytical approach to parallel repetition
- Global Roman domination in trees
- Global Roman domination in graphs
Cited In (2)
This page was built for publication: Hardness results of global Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831760)
