Algorithmic aspects of outer independent Roman domination in graphs

DOI10.1142/S1793830922500045zbMath1493.05237OpenAlexW3195598330MaRDI QIDQ5101892

No author found.

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-completeRoman dominationouter independent Roman domination

Mathematics Subject Classification ID

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

Related Items (1)

New results on quadruple Roman domination in graphs

Cites Work

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

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