Roman \(\{2\}\)-domination problem in graphs

DOI10.7151/dmgt.2332zbMath1485.05132OpenAlexW3032184616MaRDI QIDQ2118251

Hangdi Chen, Chang-hong Lu

Publication date: 22 March 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2332

zbMATH Keywords

algorithmsdominationRoman \(\{2\}\)-domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Total Roman \(\{2\}\)-dominating functions in graphs ⋮ Approximation algorithm for (connected) Italian dominating function

Cites Work

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Italian domination in trees
• Upper bounds on Roman domination numbers of graphs
• Labelling algorithms for paired-domination problems in block and interval graphs
• Total domination in block graphs
• Roman domination in graphs.
• Independent Roman \(\{2 \}\)-domination in graphs
• On computing a minimum secure dominating set in block graphs
• Power domination in block graphs
• Extremal Problems for Roman Domination

This page was built for publication: Roman \(\{2\}\)-domination problem in graphs