Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number

DOI10.7151/dmgt.2299zbMath1492.05120OpenAlexW3005280088MaRDI QIDQ2151206

Abolfazl Poureidi, Nader Jafari Rad

Publication date: 1 July 2022

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

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

zbMATH Keywords

algorithm3-SATindependent 2-rainbow dominating functionindependent Roman \(\{2\}\)-dominating function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Bounds on the 2-rainbow domination number of graphs
• On rainbow domination numbers of graphs
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• Rainbow domination in graphs
• Roman domination in graphs.
• Independent Roman \(\{2 \}\)-domination in graphs
• Independent rainbow domination of graphs
• On the 2-rainbow domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Planar Formulae and Their Uses

This page was built for publication: Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number