Effect of vertex deletion on the weak Roman domination number of a graph
P. Roushini Leely Pushpam, M. Kamalam
AKCE International Journal of Graphs and Combinatorics · 2019
doi:10.1016/j.akcej.2017.12.003 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Let G=(V,E)be a graph and f:V→{0,1,2}be a function. The weight of a vertex u∈V is f(u)and a vertex u with weightf(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∈Vf(v). The weak Roman domination number, denoted by γr(G), is the minimum weight of a weak Roman dominating function on G. In this paper we examine the effects on γr(G)when G is modified by deleting a vertex. Keywords: Weak roman domination number, Changing and unchanging, Vertex deletion
Abstract licence: CC BY-NC-ND
References13
13 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.