Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Weak roman domination in graphs

P. Roushini Leely PushpamT.N.M. Malini Mai — 2011

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph and f be a function f:V → 0,1,2. A vertex u with f(u) = 0 is said to be undefended with respect to f, if it is not adjacent to a vertex with positive weight. The function f is a weak Roman dominating function (WRDF) if each vertex u with f(u) = 0 is adjacent to a vertex v with f(v) > 0 such that the function f’: V → 0,1,2 defined by f’(u) = 1, f’(v) = f(v)-1 and f’(w) = f(w) if w ∈ V-u,v, has no undefended vertex. The weight of f is w ( f ) = v V f ( v ) . The weak Roman domination number,...

Page 1

Download Results (CSV)