Bounds on the 2-rainbow domination number of graphs

From MaRDI portal
Publication:354420

DOI10.1007/s00373-012-1158-yzbMath1268.05154arXiv1005.0988OpenAlexW2154705857MaRDI QIDQ354420

Nader Jafari Rad, Yun Jian Wu

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.0988




Related Items (33)

Roman \(\{2 \}\)-dominationAveraging 2-rainbow domination and Roman dominationOn 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 twoIndependent 2-rainbow domination in treesRainbow domination numbers on graphs with given radiusAlgorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination numberOn the complexity of reinforcement in graphsOn the rainbow domination number of digraphsUpper bound on 3-rainbow domination in graphs with minimum degree 2Further results on maximal rainbow domination numberRelating 2-rainbow domination to Roman dominationThe \(k\)-rainbow bondage number of a graphIndependent Roman \(\{2 \}\)-domination in graphsWeak \(\{2\}\)-domination number of Cartesian products of cyclesUnnamed ItemOn the sum of the total domination numbers of a digraph and its converse2-rainbow domination number of \(C_n\square C_5\)Total 2-rainbow domination numbers of treesGeneral upper bounds on independent \(k\)-rainbow domination2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)The Cartesian product of cycles with small 2-rainbow domination numberThe \(k\)-rainbow reinforcement numbers in graphsGraphs with large total 2-rainbow domination numberBounds on weak Roman and 2-rainbow domination numbersUnnamed ItemRainbow Domination in GraphsTotal $k$-Rainbow domination numbers in graphsOn 2-rainbow domination number of functigraph and its complementRainbow edge domination numbers in graphs2-rainbow domination stability of graphsThe \(k\)-rainbow bondage number of a digraphGeneral bounds on rainbow domination numbers




Cites Work




This page was built for publication: Bounds on the 2-rainbow domination number of graphs