Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees

DOI10.1007/s40840-015-0284-0zbMath1339.05276OpenAlexW2278299270MaRDI QIDQ726513

M. Falahat, Jafar Amjadi, Nader Jafari Rad, Seyyed Mahmoud Sheikholeslami

Publication date: 11 July 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0284-0

zbMATH Keywords

strong equality2-rainbow domination numberindependent 2-rainbow domination number

Mathematics Subject Classification ID

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

Related Items (7)

A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two ⋮ Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number ⋮ Unnamed Item ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ Double Roman domination in digraphs ⋮ Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers ⋮ Rainbow Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-rainbow bondage number of a graph
• A characterization of graphs with equal domination number and vertex cover number
• A labeling algorithm for distance domination on block graphs
• Rainbow domination in graphs
• Strong equality of domination parameters in trees
• Signed \(k\)-domatic numbers of digraphs
• On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
• On the 2-rainbow domination in graphs
• 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: Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees