On the algorithmic complexity of Roman \2\-domination (Italian domination)

DOI10.1007/S40995-020-00875-7MaRDI QIDQ7232198zbMATH OpenFDO

Authors Abolfazl Poureidi, Nader Jafari Rad

Publication date 22 April 2026

Published in Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40995-020-00875-7

zbMATH Keywords

3-SATalgorithmplanar 3-SAT problemRoman \(\{2\}\)-dominating function

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Cites work

• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination in trees
• Graphs with large Italian domination number
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Italian domination in trees
• On domination multisubdivision number of unicyclic graphs
• On domination, 2-domination, and Italian domination numbers
• Planar Formulae and Their Uses
• Restrained domination in unicyclic graphs
• Roman \(\{2 \}\)-domination
• Roman domination in graphs.
• Roman domination in unicyclic graphs
• Roman, Italian, and 2-domination

Cited in

(1)

• Hardness and algorithmic results for Roman \{3\}-domination

This page was built for publication: On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232198)