The k-rainbow reinforcement numbers in graphs

The k-rainbow reinforcement number of G, denoted by rrk(G), is the minimum number of edges that must be added to G in order to decrease the k-rainbow domination number. In this paper, we study the k-rainbow reinforcement number of graphs to compare γrk and γrk′ for k≠k′, and present some sharp bounds concerning the invariant.