On the \(k\)-strong Roman domination problem

DOI10.1016/j.dam.2020.05.018zbMath1447.05156OpenAlexW3036653960MaRDI QIDQ2197424

Anahita Khojandi, Zeyu Liu, Xue-Ping Li

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.018

zbMATH Keywords

Benders decompositionRoman dominationL-shaped method\(k\)-strong Roman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Roman game domination number of a graph
• Upper bounds on Roman domination numbers of graphs
• Global Roman domination in graphs
• The roman domatic number of a graph
• Efficient algorithms for Roman domination on some classes of graphs
• Roman domination in regular graphs
• Partitioning procedures for solving mixed-variables programming problems
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Mixed Roman domination in graphs
• Location analysis: a synthesis and survey
• Defending the Roman Empire---a new strategy
• Signed Roman \(k\)-domination in trees
• On the strong Roman domination number of graphs
• On the double Roman domination in graphs
• Exact algorithms for weak Roman domination
• Signed Roman domination in graphs
• Roman dominating influence parameters
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Extremal Problems for Roman Domination
• ROMAN k-DOMINATION IN GRAPHS
• Total Roman domination in graphs
• The distance Roman domination numbers of graphs
• The Location of Emergency Service Facilities
• On maximal Roman domination in graphs
• Signed Roman \(k\)-domination in graphs

This page was built for publication: On the \(k\)-strong Roman domination problem