Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers

DOI10.22108/toc.2015.6518zbMath1463.05392OpenAlexW1882903746MaRDI QIDQ5134329

M. Falahat, Mustapha Chellali, Jafar Amjadi, Seyyed Mahmoud Sheikholeslami

Publication date: 16 November 2020

Full work available at URL: http://toc.ui.ac.ir/article_6518_70bb50bdb82bf7fe7c4d75610adbf9cd.pdf

zbMATH Keywords

treeunicyclic graphstrong equality2-rainbow domination numberindependent 2-rainbow domination number

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Rainbow Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• Rainbow domination in graphs
• Strong equality of domination parameters in trees
• On the 2-rainbow domination in graphs
• Strong equality between the Roman domination and independent Roman domination numbers in trees
• The k-rainbow domatic number of a graph
• New bounds on the rainbow domination subdivision number
• Paired-domination in graphs

This page was built for publication: Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers