On algorithmic complexity of double Roman domination

DOI10.1016/J.DAM.2020.06.023MaRDI QIDQ2197468zbMATH OpenOpenAlexFDO

Authors Abolfazl Poureidi, Nader Jafari Rad

Publication date 31 August 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.06.023

zbMATH Keywords

algorithmdominating setcombinatorial problems3-SATdouble Roman dominating function

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Algorithmic results on double Roman domination in graphs
• Some progress on the double Roman domination in graphs
• On the double Roman domination in graphs
• Algorithmic aspects of Roman graphs
• Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination 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 7362655 (Why is no real title available?)
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination
• Double Roman domination in trees
• On the double Roman domination in graphs
• On the double Roman domination of graphs
• Planar Formulae and Their Uses
• Roman domination in graphs
• Roman domination in graphs.
• Some progress on the double Roman domination in graphs
• Varieties of Roman domination. II

Cited in

(13)

• On the complexity of some hop domination parameters
• Varieties of Roman Domination
• Maximal double Roman domination in graphs
• The \(k\)-th Roman domination problem is polynomial on interval graphs
• Solving the minimum-cost double Roman domination problem
• Some progress on the double Roman domination in graphs
• Bounds on the outer-independent double Italian domination number
• Algorithmic aspects of Roman graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Double Roman domination in graphs: algorithmic complexity
• Algorithmic results on double Roman domination in graphs
• On the double Roman domination in graphs
• Algorithm and hardness results in double Roman domination of graphs

This page was built for publication: On algorithmic complexity of double Roman domination

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