مرور Volume 1, Issue 1 بر اساس موضوع "Roman domination number"
در حال نمایش موارد 1 - 1 از 1
-
Bounds on the restrained Roman domination number of a graph
(Azarbaijan Shahid Madani University, 2016-06-01)A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A ...



