Rainbow domination in graphs
From MaRDI portal
Publication:928382
DOI10.11650/twjm/1500602498zbMath1163.05046OpenAlexW1557513888MaRDI QIDQ928382
Michael A. Henning, Boštjan Brešar, Douglas F. Rall
Publication date: 18 June 2008
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500602498
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (93)
Roman \(\{2 \}\)-domination ⋮ Averaging 2-rainbow domination and Roman 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 ⋮ Unnamed Item ⋮ A note on the bounds of Roman domination numbers ⋮ A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers ⋮ Rainbow domination numbers on graphs with given radius ⋮ 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 ⋮ On the rainbow domination number of digraphs ⋮ 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 ⋮ Relating 2-rainbow domination to Roman domination ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Vizing's conjecture for graphs with domination number 3 -- a new proof ⋮ Rainbow domination numbers of generalized Petersen graphs ⋮ The \(k\)-rainbow bondage number of a graph ⋮ Some rainbow problems in graphs have complexity equivalent to satisfiability problems ⋮ Independent rainbow domination of graphs ⋮ Unnamed Item ⋮ Roman \(k\)-domination: hardness, approximation and parameterized results ⋮ The Outer-Paired Domination of Graphs ⋮ \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms] ⋮ Independent Roman \(\{2 \}\)-domination in graphs ⋮ On the 2-rainbow domination stable graphs ⋮ Rainbow domination regular graphs that are not vertex transitive ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ \(k\)-rainbow domatic numbers ⋮ On bondage numbers of graphs: a survey with some comments ⋮ 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 ⋮ General upper bounds on independent \(k\)-rainbow domination ⋮ On the 2-rainbow domination in graphs ⋮ 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) ⋮ On Cartesian products having a minimum dominating set that is a box or a stairway ⋮ On rainbow domination numbers of graphs ⋮ The Cartesian product of cycles with small 2-rainbow domination number ⋮ Efficient enumeration of dominating sets for sparse 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 ⋮ Some results on Vizing's conjecture and related problems ⋮ Italian domination in the Cartesian product of paths ⋮ The 2-rainbow bondage number in generalized Petersen graphs ⋮ Unnamed Item ⋮ Italian domination of Cartesian products of directed cycles ⋮ 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 ⋮ A note on the 2-rainbow bondage numbers in graphs ⋮ On the rainbow domination subdivision numbers in graphs ⋮ Total domination in generalized prisms and a new domination invariant ⋮ Unnamed Item ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Unnamed Item ⋮ Roman Domination in Graphs ⋮ Rainbow Domination in Graphs ⋮ Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice ⋮ 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 ⋮ Total domination in digraphs ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ On \(k\)-rainbow domination in regular graphs ⋮ Rainbow edge domination numbers in graphs ⋮ Computing strong Roman domination of trees and unicyclic graphs in linear time ⋮ 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 ⋮ The \(k\)-rainbow bondage number of a digraph ⋮ General bounds on rainbow domination numbers ⋮ On computing secure domination of trees ⋮ Restrained k-rainbow reinforcement number in graphs
This page was built for publication: Rainbow domination in graphs
