Varieties of Roman Domination | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …

Since 2016, when the first paper of the double Roman domination appeared, the topic has
received considerable attention in the literature. We survey known results on double Roman …

An outer independent double Roman dominating function (OIDRDF) of a graph G is a
function h from V (G) to {0, 1, 2, 3} for which each vertex with label 0 is adjacent to a vertex …

A signed double Roman dominating function (SDRDF) on a graph G=(V, E) is a function f: V
(G)→{− 1, 1, 2, 3} such that (i) every vertex v with f (v)=− 1 is adjacent to at least two vertices …

A double Roman dominating function (DRDF) on a graph G=(V, E) is a function f: V→{0, 1, 2,
3} having the property that if f (v)= 0, then vertex v must have at least two neighbors assigned …

For a graph G=(V, E) G=(V, E), a double Roman dominating function (DRDF) on G is a
function f: V → {0, 1, 2, 3\} f: V→ 0, 1, 2, 3 having the property that if f (v)= 0 f (v)= 0, then …

In this paper, we obtain the Italian domination number, perfect Italian domination number
and double Roman domination number of generalized Sierpiński graph S (G, 2), where G is …

Given a graph G=(V, E) G=(V, E), a function f: V ⟶ {0, 1, 2, 3\} f: V⟶ 0, 1, 2, 3 is called a
double Roman dominating function on G if (i) for every v ∈ V v∈ V with f (v)= 0 f (v)= 0, there …

A double Roman dominating function (DRDF) on a graph G=(V, E) is a function f: V→{0, 1, 2,
3} having the property that if f (v)= 0, then vertex v must have at least two neighbors assigned …

For a graph G=(V, E), a double Roman dominating function (DRDF) is a function f: V→{0, 1,
2, 3} having the property that if f (v)= 0, then vertex v must have at least two neighbours …