| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949749 | Discrete Applied Mathematics | 2017 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
J. Amjadi, L. Asgharsharghi, N. Dehgardi, M. Furuya, S.M. Sheikholeslami, L. Volkmann,