Algorithmic aspects of total Roman {3}-domination in graphs

DOI10.1142/S1793830921500634zbMath1478.05102OpenAlexW3110357715MaRDI QIDQ5025138

Palagiri Venkata Subba Reddy, Padamutham Chakradhar

Publication date: 1 February 2022

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

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

zbMATH Keywords

NP-completenessinteger linear programmingAPX-completenesstotal Roman \(\{3\}\)-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 (2)

Outer independent double Italian domination: Complexity, characterization ⋮ Algorithmic aspects of certified domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• On the Roman domination number of a graph
• Optimization, approximation, and complexity classes
• Roman domination in graphs.
• Some APX-completeness results for cubic graphs
• Algorithmic aspects of semitotal domination in graphs
• Threshold graphs and related topics
• Roman \(\{ 3 \}\)-domination (double Italian domination)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Total Domination in Graphs
• Total double Roman domination in graphs
• Improved mixed integer linear programing formulations for roman domination problem
• Node-and edge-deletion NP-complete problems
• Algorithms and Computation

This page was built for publication: Algorithmic aspects of total Roman {3}-domination in graphs