Rainbow reinforcement numbers in digraphs
From MaRDI portal
Publication:2979763
DOI10.1142/S1793557117500048zbMath1360.05117MaRDI QIDQ2979763
Rana Khoeilar, Seyyed Mahmoud Sheikholeslami
Publication date: 26 April 2017
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the rainbow domination number of digraphs
- The \(k\)-rainbow bondage number of a graph
- The \(k\)-rainbow reinforcement numbers in graphs
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Reinforcement numbers of digraphs
- On the out-domination and in-domination numbers of a digraph
- The \(k\)-rainbow bondage number of a digraph
- On the 2-rainbow domination in graphs
- The k-rainbow domatic number of a graph
- New bounds on the rainbow domination subdivision number
- The k-Rainbow Domination and Domatic Numbers of Digraphs
This page was built for publication: Rainbow reinforcement numbers in digraphs