Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
type: Item
instance of: scholarly article
title: Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
zbMATH Open document ID: 1339.05276
author: M. Falahat
author: J. Amjadi
author: Seyed Mahmood Sheikholeslami
author: Nader Jafari Rad
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2016-07-11T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6602927
zbMATH Keywords: 2-rainbow domination number
zbMATH Keywords: independent 2-rainbow domination number
zbMATH Keywords: strong equality
MaRDI profile type: Publication
full work available at URL: s40840-015-0284-0
OpenAlex ID: W2278299270
cites work: On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
cites work: Signed \(k\)-domatic numbers of digraphs
cites work: Rainbow domination in graphs
cites work: On the 2-rainbow domination in graphs
cites work: Q5278809
cites work: The \(k\)-rainbow bondage number of a graph
cites work: New bounds on the rainbow domination subdivision number
cites work: Strong equality of domination parameters in trees
cites work: Strong equality of upper domination and independence in trees
cites work: Paired-domination in graphs
cites work: Q4368728
cites work: The \(k\)-rainbow domatic number of a graph
cites work: A characterization of graphs with equal domination number and vertex cover number
cites work: A labeling algorithm for distance domination on block graphs
DOI: 10.1007/S40840-015-0284-0
description: scientific article; zbMATH DE number 6602927