The k-rainbow bondage number of a digraph
From MaRDI portal
Publication:2344014
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Bounds on the 2-rainbow domination number of graphs
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- On the 2-rainbow domination in graphs
- Rainbow domination in graphs
- Rainbow domination on trees
- The \(k\)-rainbow bondage number of a graph
- The \(k\)-rainbow domatic number of a graph
- The bondage number of a graph
- The rainbow domination number of a digraph
Cited in
(7)- A note on \(2\)-rainbow domination number of digraphs.
- Rainbow domination in graphs
- The \(k\)-rainbow domination and domatic numbers of digraphs
- The \(k\)-rainbow bondage number of a graph
- Bounds on the \(k\)-rainbow domination number of digraphs
- Rainbow domination in the Cartesian product of directed paths
- Rainbow reinforcement numbers in digraphs
This page was built for publication: The \(k\)-rainbow bondage number of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344014)