the generous roman domination number

Let g = (v,e) be a simple graph and f : v → {0, 1, 2, 3} be a function. a vertex u with f (u) = 0 is called an undefended vertex with respect to f if it is not adjacent to a vertex v with f(v) ≥ 2. we call the function f a generous roman dominating function (grdf) if for every vertex with f (u) = 0 there exists at least a vertex v with f(v) ≥ 2 adjacent to u such that the function f′ : v → {0, 1, 2, 3}, defined by f′(u) = α, f′(v) = f(v) − α where α = 1 or 2, and f′(w) = f(w) if w ∈ v − {u, v} has no undefended vertex. the weight of a generous roman dominating function f is the value f(v ) = p u∈v f(u). the minimum weight of a generous roman dominating function on a graph g is called the generous roman domination number of g, denoted by γgr (g). in this paper, we initiate the study of generous roman domination and show its relationships. also, we give the exact values for paths and cycles. moreover, we present an upper bound on the generous roman domination number, and we characterize cubic graphs g of order n with γgr (g) = n−1, and a nordhaus-gaddum type inequality for the parameter is also given. finally, we study the complexity of this parameter.