Restrained k-rainbow reinforcement number in graphs
From MaRDI portal
Publication:5876873
DOI10.1142/S1793557122502217zbMATH Open1504.05212OpenAlexW4225723761MaRDI QIDQ5876873FDOQ5876873
Authors:
Publication date: 2 February 2023
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557122502217
Recommendations
- The restrained \(k\)-rainbow reinforcement number of graphs
- The \(k\)-rainbow reinforcement numbers in graphs
- Total k-rainbow reinforcement number in graphs
- The restrained rainbow bondage number of a graph
- Restrained reinforcement number in graphs
- Rainbow restrained domination numbers in graphs.
- The \(k\)-rainbow bondage number of a graph
- Total \(k\)-rainbow domination numbers in graphs
- Rainbow reinforcement numbers in digraphs
- The \(k\)-rainbow domatic number of a graph
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rainbow domination in graphs
- Total \(k\)-rainbow domination numbers in graphs
- The restrained \(k\)-rainbow reinforcement number of graphs
- The \(k\)-rainbow reinforcement numbers in graphs
- Total Roman reinforcement in graphs
- Roman reinforcement in graphs
- Restrained reinforcement number in graphs
- Total k-rainbow reinforcement number in graphs
- Rainbow restrained domination numbers in graphs.
- On the rainbow restrained domination number.
- Double Roman reinforcement number in graphs
Cited In (2)
This page was built for publication: Restrained k-rainbow reinforcement number in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5876873)
