Rainbow domination on trees

From MaRDI portal
Publication:968106

DOI10.1016/j.dam.2009.08.010zbMath1226.05191OpenAlexW2084056055MaRDI QIDQ968106

Xuding Zhu, Jiaojiao Wu, Gerard Jennhwa Chang

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.08.010




Related Items (45)

On the outer independent 2-rainbow domination number of Cartesian products of paths and cyclesA sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least twoA new approach on locally checkable problemsOn the algorithmic complexity of edge total dominationRainbow domination numbers on graphs with given radiusOn the k-rainbow domination in graphs with bounded tree-widthMaximal 2-rainbow domination number of a graphBounds on the 2-rainbow domination number of graphsUpper bound on 3-rainbow domination in graphs with minimum degree 2The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphsDomination parameters with number 2: interrelations and algorithmic consequencesRainbow domination numbers of generalized Petersen graphsThe \(k\)-rainbow bondage number of a graphIndependent rainbow domination of graphsOn the 2-rainbow independent domination numbers of some graphs\(k\)-rainbow domatic numbersRainbow reinforcement numbers in digraphsUnnamed ItemRainbow domination and related problems on strongly chordal graphsRainbow domination in the lexicographic product of graphsA tight upper bound for 2-rainbow domination in generalized Petersen graphs2-rainbow domination number of \(C_n\square C_5\)Total 2-rainbow domination numbers of treesOn rainbow domination numbers of graphsThe \(k\)-rainbow reinforcement numbers in graphsComplexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphsNordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graphThe 2-rainbow bondage number in generalized Petersen graphsGraphs with large total 2-rainbow domination numberBounding the \(k\)-rainbow total domination numberAn efficient algorithm for distance total domination in block graphsThe strong domination problem in block graphs and proper interval graphsA note on the 2-rainbow bondage numbers in graphsOn the rainbow domination subdivision numbers in graphsUnnamed ItemRainbow Domination in GraphsTotal $k$-Rainbow domination numbers in graphsOuter independent rainbow dominating functions in graphsOn 2-rainbow domination number of functigraph and its complementOn \(k\)-rainbow domination in regular graphsRainbow edge domination numbers in graphsThe restrained k-rainbow reinforcement number of graphsTrees with equal total domination and 2-rainbow domination numbersThe \(k\)-rainbow bondage number of a digraphGeneral bounds on rainbow domination numbers



Cites Work




This page was built for publication: Rainbow domination on trees