On maximal Roman domination in graphs

DOI10.1080/00207160.2015.1052804zbMath1342.05095OpenAlexW2337802335MaRDI QIDQ5739600

Dorota Kuziak, V. Samodivkin, Mustapha Chellali, Hossein Abdollahzadeh Ahangar

Publication date: 19 July 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1052804

zbMATH Keywords

Roman dominationmaximal Roman domination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Integer linear programming formulations for double roman domination problem ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ Maximal 2-rainbow domination number of a graph ⋮ On the \(k\)-strong Roman domination problem ⋮ Unnamed Item ⋮ Maximal double Roman domination in graphs ⋮ Varieties of Roman domination II ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ Outer-independent total Roman domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• The differential and the roman domination number of a graph
• Extremal Problems for Roman Domination
• A new graph product and its spectrum

This page was built for publication: On maximal Roman domination in graphs