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

DOI10.22049/CCO.2021.27063.1189MaRDI QIDQ6101489zbMATH OpenOpenAlexFDO

Authors

Publication date 1 June 2023

Full work available at URL http://comb-opt.azaruniv.ac.ir/article_14264.html

zbMATH Keywords

APX-completenessRoman \(\{2\}\)-dominating functiontotal Roman \(\{2\}\)-domination

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)

Recommendations

• Algorithmic aspects of total Roman and total double Roman domination in graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
• Algorithmic aspects of Roman domination in graphs
• Total Roman \(\{2\}\)-domination in graphs
• Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
• Roman \(\{2\}\)-domination problem in graphs
• Algorithmic results on double Roman domination in graphs
• Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
• Total Roman \(\{2\}\)-dominating functions in graphs

Cites work

• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Algorithmic aspects of semitotal domination in graphs
• Algorithms and Computation
• Approximation hardness of dominating set problems in bounded degree graphs
• Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
• Further progress on the total Roman \(\{2\}\)-domination number of graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Node-and edge-deletion NP-complete problems
• Optimization, approximation, and complexity classes
• Roman \(\{2 \}\)-domination
• Some APX-completeness results for cubic graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Threshold graphs and related topics
• Total domination in graphs
• Total Roman \(\{2\}\)-dominating functions in graphs
• Trees with equal Roman \{2\}-domination number and independent Roman \{2\}-domination number

Cited in

(7)

• Approximation algorithm for (connected) Italian dominating function
• New results on quadruple Roman domination in graphs
• Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
• Approximation algorithm for the minimum partial connected Roman dominating set problem
• Total 2-rainbow domination in graphs: complexity and algorithms
• New bounds on the outer-independent total double Roman domination number
• Total Roman domination and total domination in unit disk graphs

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

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