Rainbow domination in graphs
From MaRDI portal
Publication:3384615
DOI10.1007/978-3-030-51117-3_12zbMATH Open1479.05247OpenAlexW4214535350MaRDI QIDQ3384615FDOQ3384615
Authors: Boštjan Brešar 
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1500602498
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Roman domination in graphs.
- Difference between 2-rainbow domination and roman domination in graphs
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Roman \(\{2 \}\)-domination
- Averaging 2-rainbow domination and Roman domination
- On 2-rainbow domination and roman domination in graphs
- Bounds on the 2-rainbow domination number of graphs
- Title not available (Why is that?)
- Total domination in graphs
- Title not available (Why is that?)
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Note on 2-rainbow domination and Roman domination in graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Title not available (Why is that?)
- Domination in graphs with minimum degree two
- Rainbow domination on trees
- The domination number of grids
- Vizing's conjecture: a survey and recent results
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- The \(k\)-rainbow domatic number of a graph
- New bounds on the rainbow domination subdivision number
- On the complexity of reinforcement in graphs
- The \(k\)-rainbow bondage number of a graph
- Title not available (Why is that?)
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination numbers on graphs with given radius
- The k-Rainbow Domination and Domatic Numbers of Digraphs
- On the rainbow domination number of digraphs
- Total $k$-Rainbow domination numbers in graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- On rainbow domination numbers of graphs
- Title not available (Why is that?)
- On dominating the Cartesian product of a graph and K2
- An inequality related to Vizing's conjecture
- The \(k\)-rainbow bondage number of a digraph
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- General bounds on rainbow domination numbers
- \(k\)-rainbow domatic numbers
- Title not available (Why is that?)
- On Cartesian products having a minimum dominating set that is a box or a stairway
- Title not available (Why is that?)
- The Cartesian product of cycles with small 2-rainbow domination number
- The \(k\)-rainbow reinforcement numbers in graphs
- Italian domination in trees
- Some results on Vizing's conjecture and related problems
- Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- On 2-rainbow domination of generalized Petersen graphs
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- 2-rainbow domination number of \(C_n\square C_5\)
- On \(k\)-rainbow domination in regular graphs
- Title not available (Why is that?)
- General upper bounds on independent \(k\)-rainbow domination
- On \(k\)-rainbow independent domination in graphs
- Independent rainbow domination of graphs
- Independent 2-rainbow domination in graphs
- Independent 2-rainbow domination in trees
- Total domination in generalized prisms and a new domination invariant
- An improvement on Vizing's conjecture
- A note on total domination and 2-rainbow domination in graphs
- Relating 2-rainbow domination to Roman domination
- Domination parameters with number 2: interrelations and algorithmic consequences
- Rainbow domination and related problems on strongly chordal graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- Trees with equal total domination and 2-rainbow domination numbers
- Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
- The 2-domination and Roman domination numbers of grid graphs
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- On the rainbow domination subdivision numbers in graphs
- On the 2-rainbow bondage number of planar graphs.
- Title not available (Why is that?)
- Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers
- Title not available (Why is that?)
Cited In (8)
- Critical concept for 2-rainbow domination in graphs
- Rainbow domination in graphs
- On rainbow domination of generalized Petersen graphs \(P ( c k , k )\)
- Rainbow perfect domination in lattice graphs
- Title not available (Why is that?)
- Domination-related parameters in middle graphs
- On the rainbow domination number of digraphs
- Independent k -rainbow bondage number of graphs
This page was built for publication: Rainbow domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384615)
