| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874123 | Information Processing Letters | 2018 | 7 Pages |
Abstract
We show that the weak Roman domination number of a connected n-vertex graph is at most 2n3 and characterize the graphs achieving equality. In addition, we provide a constructive characterization of the trees for which the weak Roman domination number equals the Roman domination number and reveal several structural properties of these trees. This answers a problem posed in M. Chellali et al. (2014) [4].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Enqiang Zhu, Zehui Shao,