Sep 15, 2020 · In this paper, it is introduced and studied a variant of Roman dominating functions, namely, Roman { 3 } -dominating functions or double Italian ...
A Roman {2}-dominating function f : V → {0,1,2} such that for every vertex v ∈ V , with f(v) = 0, f(N(v)) ≥ 2, that is, either there is a vertex u ∈ N(v) ...
Feb 13, 2020 · A vertex-edge Roman dominating function (or just ve-RDF) of a graph G = (V,E) is a function f : V (G) →{0, 1, 2} such that for each edge e = uv ...
For a graph G, a double Italian (Roman {3}-)dominating function is a function 𝑓 : 𝑉 → { 0 , 1 , 2 , 3 } having the property that for every vertex 𝑢 ∈ 𝑉 , ...
Roman {3}-domination in graphs: Complexity and algorithms
www.sciencedirect.com › article › abs › pii
Sep 15, 2024 · introduced a new variant of domination called Roman -domination (also known as double Italian domination).
Feb 5, 2023 · [18] introduced the concept of double Italian domination (Roman {3}-domination). A double. Italian dominating function (DID function for ...
For a graph G, a Roman {3}-dominating function is a function f : V −→. {0, 1, 2, 3} having the property that for every vertex u ∈ V , if f(u) ∈ {0, 1}, then ...
We initiate the study of Roman $\{3\}$-domination and show its relationship to domination, Roman domination, Roman $\{2\}$-domination (Italian domination) and ...
If G is a graph with vertex set V (G), then let N[u] be the closed neighborhood of the vertex u ∈ V (G). A total double. Italian dominating function ...
A double Roman dominating function (abbreviated DRD- function) on a graph G is a function f : V → {0, 1, 2, 3} such that the following conditions are met: (a) ...