Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Double Roman domination: a survey
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 …
received considerable attention in the literature. We survey known results on double Roman …
Triple Roman domination in graphs
The Roman domination in graphs is well-studied in graph theory. The topic is related to a
defensive strategy problem in which the Roman legions are settled in some secure cities of …
defensive strategy problem in which the Roman legions are settled in some secure cities of …
On the total double Roman domination
Let G=(V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a
function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u)= 0, then u must have at …
function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u)= 0, then u must have at …
[HTML][HTML] Roman {3}-domination (double Italian domination)
For a graph G=(V, E) with V= V (G) and E= E (G), a Roman {3}-dominating function is a
function f: V→{0, 1, 2, 3} having the property that∑ u∈ NG (v) f (u)≥ 3, if f (v)= 0, and∑ u∈ …
function f: V→{0, 1, 2, 3} having the property that∑ u∈ NG (v) f (u)≥ 3, if f (v)= 0, and∑ u∈ …
Bounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF) on a graph $ G $ with
vertex set $ V (G) $ is a function $ f: V (G)\longrightarrow\{0, 1, 2, 3\} $ such that if $ f (v)\in\{0 …
vertex set $ V (G) $ is a function $ f: V (G)\longrightarrow\{0, 1, 2, 3\} $ such that if $ f (v)\in\{0 …
On the outer independent double Roman domination number
An outer independent (double) Roman dominating function is a (double) Roman dominating
function f for which the set of vertices assigned 0 under f is independent. The outer …
function f for which the set of vertices assigned 0 under f is independent. The outer …
Quadruple Roman domination in graphs
Let G be a finite and simple graph with vertex set V (G). Let f be a function that assigns label
from the set {0, 1, 2, 3, 4, 5} to the vertices of a graph G. For a vertex v∈ V (G), the active …
from the set {0, 1, 2, 3, 4, 5} to the vertices of a graph G. For a vertex v∈ V (G), the active …
Further Progress on the Total Roman -Domination Number of Graphs
For a graph Γ, let γ (Γ), γ t (Γ), and γ t R 2 (Γ) denote the domination number, the total
domination number, and the total Roman {2}-domination number, respectively. It was shown …
domination number, and the total Roman {2}-domination number, respectively. It was shown …
Total Roman {3}-domination in graphs
For a graph G=(V, E) with vertex set V= V (G) and edge set E= E (G), a Roman {3}-
dominating function (R {3}-DF) is a function f: V (G)→{0, 1, 2, 3} having the property that∑ …
dominating function (R {3}-DF) is a function f: V (G)→{0, 1, 2, 3} having the property that∑ …
Covering total double Roman domination in graphs
For a graph $ G $ with no isolated vertex, a covering total double Roman dominating
function ($ CTDRD $ function) $ f $ of $ G $ is a total double Roman dominating function …
function ($ CTDRD $ function) $ f $ of $ G $ is a total double Roman dominating function …