Restrained k-rainbow reinforcement number in graphs

DOI10.1142/S1793557122502217zbMath1504.05212OpenAlexW4225723761MaRDI QIDQ5876873

No author found.

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

zbMATH Keywords

NP-hardnessrestrained \(k\)-rainbow dominationrestrained \(k\)-rainbow reinforcement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• The \(k\)-rainbow reinforcement numbers in graphs
• Rainbow domination in graphs
• Total Roman reinforcement in graphs
• Total $k$-Rainbow domination numbers in graphs
• The restrained k-rainbow reinforcement number of graphs
• Restrained reinforcement number in graphs
• Total k-rainbow reinforcement number in graphs
• Double Roman reinforcement number in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Restrained k-rainbow reinforcement number in graphs