On \(k\)-rainbow domination in regular graphs
From MaRDI portal
Publication:777421
DOI10.1016/j.dam.2020.04.003zbMath1443.05147arXiv1907.08430OpenAlexW3020130049MaRDI QIDQ777421
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.08430
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Cites Work
- Unnamed Item
- On rainbow domination numbers of graphs
- Rainbow domination in graphs
- Rainbow domination on trees
- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- On 2-rainbow domination of generalized Petersen graphs
- General bounds on rainbow domination numbers
- 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 the 2-rainbow domination in graphs
- On dominating the Cartesian product of a graph and K2
This page was built for publication: On \(k\)-rainbow domination in regular graphs