Independent roman $\{3\}$-domination

DOI10.22108/toc.2021.127953.1840OpenAlexW3215738554MaRDI QIDQ5103952

Padamutham Chakradhar, P. Venkata Subba Reddy

Publication date: 9 September 2022

Full work available at URL: https://doaj.org/article/cee71c74edf54da19da58cb568053127

zbMATH Keywords

integer linear programmingNP-completeAPX-hardindependent Roman \(\{3\}\)-dominationRoman \(\{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 (1)

Quasi-total Roman bondage number in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• On the Roman domination number of a graph
• Roman domination in graphs.
• Independent Roman \(\{2 \}\)-domination in graphs
• Threshold graphs and related topics
• Algorithmic aspects of Roman domination in graphs
• Roman \(\{ 3 \}\)-domination (double Italian domination)
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Complexity aspects of variants of independent Roman domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Strong equality between the Roman domination and independent Roman domination numbers in trees
• Complexity of Roman {2}-domination and the double Roman domination in graphs
• Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
• Improved mixed integer linear programing formulations for roman domination problem
• Node-and edge-deletion NP-complete problems
• The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
• Algorithms and Computation

This page was built for publication: Independent roman $\{3\}$-domination