A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two

zbMath1469.05134MaRDI QIDQ821316

Rana Khoeilar, Mustapha Chellali, Mahla Keibari, Seyyed Mahmoud Sheikholeslami

Publication date: 20 September 2021

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/csjm/issues/v28-n3/13240/

zbMATH Keywords

independent \(k\)-rainbow dominating functionindependent \(k\)-rainbow domination number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the 2-rainbow domination number of graphs
• Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• Rainbow domination in graphs
• Rainbow domination on trees
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• General upper bounds on independent \(k\)-rainbow domination
• Independent domination in graphs: A survey and recent results
• Independent rainbow domination of graphs
• On the 2-rainbow domination in graphs
• The k-rainbow domatic number of a graph
• Independent 2-rainbow domination in trees
• Total $k$-Rainbow domination numbers in graphs

This page was built for publication: A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two