On the rainbow domination number of digraphs
From MaRDI portal
Publication:343745
DOI10.1007/S00373-016-1692-0zbMath1349.05143OpenAlexW2342260515MaRDI QIDQ343745
Publication date: 29 November 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1692-0
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
Rainbow reinforcement numbers in digraphs ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ Unnamed Item ⋮ Rainbow Domination in Graphs ⋮ A note on lower bounds for the total domination number of digraphs
Cites Work
- Bounds on the 2-rainbow domination number of graphs
- Directed domination in oriented graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Note on 2-rainbow domination and Roman domination in graphs
- Rainbow domination numbers on graphs with given radius
- Dominating Set and Converse Dominating Set of a Directed Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the rainbow domination number of digraphs
