The Roman \(\{2 \}\)-domatic number of graphs

DOI10.1016/J.DAM.2018.11.027zbMath1407.05185OpenAlexW2904463651MaRDI QIDQ1732117

Lutz Volkmann

Publication date: 22 March 2019

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

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

zbMATH Keywords

dominationRoman \(\{2 \}\)-dominationRoman \(\{2 \}\)-domatic number

Mathematics Subject Classification ID

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

Related Items (6)

The Roman domatic problem in graphs and digraphs: a survey ⋮ Graphs with small Italian domatic number ⋮ Regular graphs with large Italian domatic number ⋮ Some new results on the b-domatic number of graphs ⋮ Restrained Roman and restrained Italian domatic numbers of graphs ⋮ On the Roman {2}-domatic number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• The roman domatic number of a graph
• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• On Complementary Graphs
• Extremal Problems for Roman Domination
• Towards a theory of domination in graphs

This page was built for publication: The Roman \(\{2 \}\)-domatic number of graphs