Hardness and approximation results of Roman \{3\}-domination in graphs

DOI10.1007/978-3-030-89543-3_9OpenAlexW3208329506MaRDI QIDQ2695277

Pooja Goyal, B. S. Panda

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_9

zbMATH Keywords

approximation algorithm\textsf{NP}-completeRoman \{3\}-domination

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Some APX-completeness results for cubic graphs
• Threshold graphs and related topics
• Roman \(\{ 3 \}\)-domination (double Italian domination)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hardness and approximation results of Roman \{3\}-domination in graphs