| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872146 | Discrete Applied Mathematics | 2014 | 6 Pages |
Abstract
We mainly study two related dominating functions, namely, the weak Roman and 2-rainbow dominating functions. We show that for all graphs, the weak Roman domination number is bounded above by the 2-rainbow domination number. We present bounds on the weak Roman domination number and the secure domination number in terms of the total domination number for specific families of graphs, and we show that the 2-rainbow domination number is bounded below by the total domination number for trees and for a subfamily of cactus graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi,