Roman domination in graphs

2003/11/06 by Ernie J Cockayne, E. J. Cockayne, Paul Dreyer +5 · 10 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems

paper · doi:10.1016/j.disc.2003.06.004

Cited by

• Roman-Type Domination on Convex and Chordal Bipartite Graphs: Algorithms and Hardness
• Roman domination in weighted graphs
• Eternal Vertex Cover Problem on Halin Graphs
• On the Complexity of Signed Roman Domination
• Enumeration With Nice Roman Domination Properties
• Domination related parameters in rooted product graphs
• Integer Linear Programming Formulations for Double Roman Domination Problem
• Hardness and Algorithmic Results for Roman \3\-Domination
• Roman Domination on 2-Connected Graphs
• Roman Domination in Convex Bipartite Graphs