Roman domination in graphs: The class ℛUV R

DOI10.1142/S179383091650049XzbMath1345.05075arXiv1508.02089MaRDI QIDQ2821115

No author found.

Publication date: 16 September 2016

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

Full work available at URL: https://arxiv.org/abs/1508.02089

zbMATH Keywords

treedominationRoman dominationRoman bondage

Mathematics Subject Classification ID

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

Related Items (4)

On the Roman domination stable graphs ⋮ On the 2-rainbow domination stable graphs ⋮ Roman Domination in Graphs ⋮ Unnamed Item

Cites Work

• Roman domination on strongly chordal graphs
• Upper bounds on Roman domination numbers of graphs
• Efficient algorithms for Roman domination on some classes of graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Roman bondage in graphs
• Trees with unique Roman dominating functions of minimum weight
• The differential and the roman domination number of a graph
• Extremal Problems for Roman Domination
• Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Roman domination in graphs: The class ℛUV R