a roman dominating function (rdf) on a graph g = (v,e) is defined to be a function 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 set s v is a restrained dominating set if every vertex not in s is adjacent to a vertex in s and to a vertex in . we define a restrained roman dominating function on a graph g = (v,e) to be ...

in this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on hayman conjecture. we also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...