A Roman dominating function of a graph G is a labeling f:\,V(G)→{0,1,2\} such that every
vertex with label 0 has a neighbor with label 2. The Roman domination number …

A Roman dominating function of a graph G is a function f: V (G)→{0, 1, 2} such that
whenever f (v)= 0 there exists a vertex u adjacent to v with f (u)= 2. The weight of f is w (f)=∑ …

Roman domination is an historically inspired variety of domination in graphs, in which
vertices are assigned a value from the set $\{0, 1, 2\} $ in such a way that every vertex …

A Roman dominating function of a graph G is a function f :V(G)→{0,1,2\} such that whenever
f(v)=0, there exists a vertex u adjacent to v such that f(u)=2. The weight of f is …

Roman dominating function of a graph G is a labeling function f: V (G)→{0, 1, 2} such that
every vertex with label 0 has a neighbor with label 2. The Roman domination number γR (G) …

We analyse the graph-theoretic formalization of Roman domination, dating back to the
military strategy of the Emperor Constantine, from a parameterized perspective. More …

In this paper we study the Roman domination number of some classes of planar graphs-
convex polytopes: An, Rn and Tn. We establish the exact values of Roman domination …

Let G=(V, E) be a graph with vertex set V and edge set E. A Roman dominating function is a
mapping f: V→{0, 1, 2} such that every vertex u for which f (u)= 0 is adjacent to at least one …

Abstract Let f: V → {0, 1, 2\} f: V→ 0, 1, 2 be a function, G=(V, E) G=(V, E) be a graph with a
vertex set V and a set of edges E and let the weight of the vertex u ∈ V u∈ V be defined by f …

A Roman dominating function of graph G is a function r: V (G)→{0, 1, 2} satisfying that every
vertex v with r (v)= 0 is adjacent to at least one vertex u with r (u)= 2. The minimum Roman …