Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
DOI10.1007/S40840-015-0284-0zbMATH Open1339.05276OpenAlexW2278299270MaRDI QIDQ726513FDOQ726513
Authors: M. Falahat, J. Amjadi, Seyed Mahmood Sheikholeslami, Nader Jafari Rad 
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
Recommendations
- Independent 2-rainbow domination in trees
- Trees with equal total domination and 2-rainbow domination numbers
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- Independent 2-rainbow domination in graphs
- Total 2-rainbow domination numbers of trees
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- 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
- A characterization of graphs with equal domination number and vertex cover number
- Rainbow domination in graphs
- Strong equality of domination parameters in trees
- Paired-domination in graphs
- The \(k\)-rainbow domatic number of a graph
- New bounds on the rainbow domination subdivision number
- The \(k\)-rainbow bondage number of a graph
- Title not available (Why is that?)
- A labeling algorithm for distance domination on block graphs
- Strong equality of upper domination and independence in trees
Cited In (9)
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
- Trees with equal total domination and 2-rainbow domination numbers
- General upper bounds on independent \(k\)-rainbow domination
- A new upper bound on the independent 2-rainbow domination number in trees
- Double Roman domination in digraphs
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- Independent 2-rainbow domination in trees
- Rainbow domination in graphs
This page was built for publication: Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726513)
