Complexity aspects of restrained Roman domination in graphs

DOI10.1142/s1793830922500963zbMath1516.05162OpenAlexW4224229784MaRDI QIDQ6132244

Padamutham Chakradhar

Publication date: 14 July 2023

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

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

zbMATH Keywords

NP-completeRoman dominating functionrestrained Roman domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable colorings of bounded treewidth graphs
• Efficient algorithms for Roman domination on some classes of graphs
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Threshold graphs and related topics
• Algorithmic aspects of Roman domination in graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Complexity aspects of variants of independent Roman domination in graphs
• On trees with equal Roman domination and outer-independent Roman domination numbers

This page was built for publication: Complexity aspects of restrained Roman domination in graphs