Hardness results of global Roman domination in graphs

DOI10.1007/978-3-030-67899-9_39MaRDI QIDQ831760zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmNP-completeglobal Roman domination

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Analytical approach to parallel repetition
• Global Roman domination in graphs
• Global Roman domination in trees
• Introduction to algorithms.
• Roman domination in graphs.
• Roman domination on strongly chordal graphs

Cited in

(2)

• Hardness results of global Roman domination in graphs
• Roman \(k\)-domination: hardness, approximation and parameterized results

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)