On the 2-rainbow domination in graphs
From MaRDI portal
Publication:2457023
DOI10.1016/j.dam.2007.07.018zbMath1126.05091OpenAlexW2018464213MaRDI QIDQ2457023
Tadeja Kraner Šumenjak, Boštjan Brešar
Publication date: 29 October 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.018
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (64)
Roman \(\{2 \}\)-domination ⋮ On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles ⋮ A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two ⋮ Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ Independent 2-rainbow domination in trees ⋮ On the k-rainbow domination in graphs with bounded tree-width ⋮ Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number ⋮ Maximal 2-rainbow domination number of a graph ⋮ On the complexity of reinforcement in graphs ⋮ Bounds on the 2-rainbow domination number of graphs ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ Further results on maximal rainbow domination number ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ On the thinness and proper thinness of a graph ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ The \(k\)-rainbow bondage number of a graph ⋮ Independent rainbow domination of graphs ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ On the 2-rainbow domination stable graphs ⋮ On the 2-rainbow independent domination numbers of some graphs ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ Rainbow reinforcement numbers in digraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ Rainbow domination in the lexicographic product of graphs ⋮ A tight upper bound for 2-rainbow domination in generalized Petersen graphs ⋮ 2-rainbow domination number of \(C_n\square C_5\) ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ Total 2-rainbow domination numbers of trees ⋮ 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) ⋮ On rainbow domination numbers of graphs ⋮ The Cartesian product of cycles with small 2-rainbow domination number ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ The \(k\)-rainbow reinforcement numbers in graphs ⋮ 2-rainbow domination in generalized petersen graphs \(P(n,3)\) ⋮ Rainbow domination on trees ⋮ Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs ⋮ Note on 2-rainbow domination and Roman domination in graphs ⋮ Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph ⋮ Italian domination in the Cartesian product of paths ⋮ The 2-rainbow bondage number in generalized Petersen graphs ⋮ Graphs with large total 2-rainbow domination number ⋮ Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers ⋮ Total domination in generalized prisms and a new domination invariant ⋮ Unnamed Item ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Rainbow Domination in Graphs ⋮ 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) ⋮ Total $k$-Rainbow domination numbers in graphs ⋮ Outer independent rainbow dominating functions in graphs ⋮ On 2-rainbow domination number of functigraph and its complement ⋮ On \(k\)-rainbow domination in regular graphs ⋮ Rainbow edge domination numbers in graphs ⋮ Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs ⋮ 2-rainbow domination stability of graphs ⋮ On \(k\)-rainbow independent domination in graphs ⋮ Total k-rainbow reinforcement number in graphs ⋮ The restrained k-rainbow reinforcement number of graphs ⋮ Trees with equal total domination and 2-rainbow domination numbers ⋮ The \(k\)-rainbow bondage number of a digraph
Cites Work
This page was built for publication: On the 2-rainbow domination in graphs
