Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs

DOI10.1142/s0129054121500180zbMath1522.68424OpenAlexW3125181823MaRDI QIDQ6114823

Amit Raj Sharma, P. Venkata Subba Reddy

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenessdomination numberouter-independent total Roman dominating set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Treewidth. Computations and approximations
• Roman domination in graphs.
• Algorithmic aspects of semitotal 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

This page was built for publication: Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs