Algorithmic aspects of outer independent Roman domination in graphs

DOI10.1142/S1793830922500045MaRDI QIDQ5101892zbMATH OpenOpenAlexFDO

Authors

Publication date 2 September 2022

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922500045

zbMATH Keywords

NP-completeouter independent Roman dominationRoman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
• Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
• Outer independent Roman dominating functions in graphs
• Outer-independent total Roman domination in graphs
• Outer independent double Roman domination

Cites work

• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Algorithmic aspects of 2-secure domination in graphs
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Algorithmic aspects of Roman domination in graphs
• Algorithmic aspects of secure connected domination in graphs
• Defending the Roman Empire---a new strategy
• 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?)
• On the Roman domination number of a graph
• Outer independent Roman dominating functions in graphs
• Outer-independent total Roman domination in graphs
• Roman domination in graphs.
• Roman domination perfect graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Threshold graphs and related topics

Cited in

(10)

• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
• Relating the outer-independent total Roman domination number with some classical parameters of graphs
• Outer-independent total Roman domination in graphs
• Outer independent Roman dominating functions in graphs
• Efficient algorithms for independent Roman domination on some classes of graphs
• Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
• New results on quadruple Roman domination in graphs
• New bounds on the outer-independent total double Roman domination number
• Outer-independent signed Roman domination function in graphs
• Algorithmic aspects of outer-independent double Roman domination in graphs

This page was built for publication: Algorithmic aspects of outer independent Roman domination in graphs

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