The restrained k-rainbow reinforcement number of graphs
From MaRDI portal
Publication:5013473
DOI10.1142/S1793830921500269zbMath1475.05142MaRDI QIDQ5013473
Saeed Shaebani, Saeed Kosari, Leila Asgharsharghi
Publication date: 30 November 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500269
restrained \(k\)-rainbow dominating function; restrained \(k\)-rainbow domination number; restrained \(k\)-rainbow reinforcement number
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Restrained k-rainbow reinforcement number in graphs, Connectivity index in vague graphs with application in construction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of reinforcement in graphs
- On the complexity of the bondage and reinforcement problems
- The \(k\)-rainbow reinforcement numbers in graphs
- Rainbow domination in graphs
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- General bounds on rainbow domination numbers
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- On the 2-rainbow domination in graphs
- On domination and reinforcement numbers in trees