TY - JOUR
ID - 13556
TI - Bounds on the restrained Roman domination number of a graph
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Abdollahzadeh Ahangar, H.
AU - Mirmehdipour, S.R.
AD - Babol Noshirvani University of Technology
AD - Babol Noshirvani University of Technology
Y1 - 2016
PY - 2016
VL - 1
IS - 1
SP - 75
EP - 82
KW - Roman dominating function
KW - Roman domination number
KW - restrained Roman dominating function
KW - restrained Roman domination number
DO - 10.22049/cco.2016.13556
N2 - A {\em Roman dominating function} on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) =2$. A {\em restrained Roman dominating} function $f$ is a Roman dominating function if the vertices with label 0 induce a subgraph with no isolated vertex. The weight of a restrained Roman dominating function is the value $\omega(f)=\sum_{u\in V(G)} f(u)$. The minimum weight of a restrained Roman dominating function of $G$ is called the { \em restrained Roman domination number} of $G$ and denoted by $\gamma_{rR}(G)$. In this paper we establish some sharp bounds for this parameter.
UR - https://comb-opt.azaruniv.ac.ir/article_13556.html
L1 - https://comb-opt.azaruniv.ac.ir/article_13556_af7da9ddc41c8343edb4835aaab47c2c.pdf
ER -