Rainbow domination in the Cartesian product of directed paths
From MaRDI portal
Publication:5374249
Recommendations
Cites work
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- Bounding the paired-domination number of a tree in terms of its annihilation number
- Bounds on the 2-rainbow domination number of graphs
- Bounds on the domination number of a digraph
- New bounds on the signed domination numbers of graphs
- On the rainbow domination number of digraphs
- Rainbow domination in graphs
- Rainbow domination numbers on graphs with given radius
- Signed domination in regular graphs
- The rainbow domination number of a digraph
Cited in
(5)
This page was built for publication: Rainbow domination in the Cartesian product of directed paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374249)