Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs

DOI10.1142/S0129054121500180MaRDI QIDQ6114823zbMATH OpenOpenAlexFDO

Authors Amit 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

domination numberNP-completenessouter-independent total Roman dominating set

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) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithmic aspects of outer independent Roman domination in graphs
• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
• Outer-independent total Roman domination in graphs
• On the outer independent total double Roman domination in graphs
• Outer independent Roman 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
• 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?)
• Outer-independent total Roman domination in graphs
• Roman domination in graphs.
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Treewidth. Computations and approximations

Cited in

(9)

• 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
• Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
• Algorithmic aspects of outer independent Roman domination in graphs
• Efficient algorithms for independent Roman domination on some classes of graphs
• Algorithmic aspects of total Roman ${2}$-domination in graphs
• Outer-independent Roman domination on Cartesian product of paths
• On the outer-independent total (Roman) domination number of some graph operators

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

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