Hardness results of global Roman domination in graphs

DOI10.1007/978-3-030-67899-9_39OpenAlexW3128085997MaRDI QIDQ831760

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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman domination on strongly chordal graphs
• Global Roman domination in graphs
• Roman domination in graphs.
• Global Roman domination in trees
• Analytical approach to parallel repetition

This page was built for publication: Hardness results of global Roman domination in graphs