Complexity aspects of restrained Roman domination in graphs

DOI10.1142/S1793830922500963MaRDI QIDQ6132244zbMATH OpenOpenAlexFDO

Authors 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-completerestrained Roman dominationRoman dominating function

Mathematics Subject Classification ID

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

Recommendations

• Restrained condition on double Roman dominating functions
• Restrained double Roman domination of a graph
• Restrained Roman domination in graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Algorithmic aspects of Roman domination in graphs

Cites work

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

Cited in

(6)

• Some progress on the restrained Roman domination
• The restrained double Roman domination in graphs
• NP-completeness and APX-completeness of restrained domination in graphs
• A mixed integer linear programming formulation for restrained Roman domination problem
• Algorithmic complexity of weakly connected Roman domination in graphs
• Roman domination parameters with respect to differentials in probabilistic neural networks

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

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