The roman domatic number of a graph

DOI10.1016/j.aml.2010.06.016zbMath1193.05129OpenAlexW2077686450MaRDI QIDQ990809

Seyyed Mahmoud Sheikholeslami, Lutz Volkmann

Publication date: 1 September 2010

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

Full work available at URL: https://doi.org/10.1016/j.aml.2010.06.016

zbMATH Keywords

roman domatic numberroman domination numberroman dominating function

Mathematics Subject Classification ID

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

Related Items (11)

A note on the Roman domatic number of a digraph ⋮ Computing Roman domatic number of graphs ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ The roman \(k\)-domatic number of a graph ⋮ The signed edge-domatic number of nearly cubic graphs ⋮ On the \(k\)-strong Roman domination problem ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ The Roman \(\{2 \}\)-domatic number of graphs ⋮ Roman Domination in Graphs ⋮ Double Roman domination and domatic numbers of graphs ⋮ Restrained Roman and restrained Italian domatic numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Extremal Problems for Roman Domination
• Towards a theory of domination in graphs

This page was built for publication: The roman domatic number of a graph