Results 11 to 20 of about 2,224,899 (247)
Some Progress on the Double Roman Domination in Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2019 For a graph G = (V,E), a double Roman dominating function (or just DRDF) is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0 for a vertex v, then v has at least two neighbors assigned 2 under f or one neighbor assigned 3 under f, and ...
Rad Nader Jafari, Rahbani Hadi
doaj +5 more sources
Perfect double Roman domination of trees
Discrete Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
TERESA Haynes
exaly +5 more sources
The Double Roman Domination Numbers of Generalized Petersen Graphs P(n, 2)
Mathematics, 2018 A double Roman dominating function (DRDF) f on a given graph G is a mapping from V ( G ) to { 0 , 1 , 2 , 3 } in such a way that a vertex u for which f ( u ) = 0 has at least a neighbor labeled 3 or two neighbors both labeled 2 ...
Huiqin Jiang +4 more
doaj +4 more sources
Restrained double Roman domination of a graph
RAIRO - Operations Research, 2022 For a graph G = (V, E), a restrained double Roman dominating function is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0, then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f(w) = 3, and if f(v) = 1, then the vertex v must have at least one neighbor w with f(w) ≥ 2, and at the same time ...
Doost Ali Mojdeh +2 more
openaire +4 more sources
Maximal double Roman domination in graphs
Applied Mathematics and Computation, 2022 A maximal double Roman dominating function (MDRDF) on a graph $G=(V,E)$ is a function $f:V(G)\rightarrow \{0,1,2,3\}$ such that \textrm{(i) }every vertex $v$ with $f(v)=0$ is adjacent to least two vertices { assigned $2$ or to at least one vertex assigned $3,$} \textrm{(ii) }every vertex $v$ with $f(v)=1$ is adjacent to at least one { vertex assigned ...
Hossein Abdollahzadeh Ahangar +3 more
openaire +3 more sources
Double Roman domination and domatic numbers of graphs [PDF]
Communications in Combinatorics and Optimization, 2018 A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in \cite{bhh} as a function $f:V(G)\rightarrow\{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned 2 ...
L. Volkmann
doaj +2 more sources
On the Outer-Independent Double Roman Domination of Graphs [PDF]
Frontiers in Applied Mathematics and Statistics, 2021 An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h:V(G)→{0,1,2,3} such that i) every vertex v with f(v)=0 is adjacent to at least one vertex with label 3 or to at least two vertices with label 2, ii) every vertex ...
Yongsheng Rao +4 more
doaj +2 more sources
Bounds on the Double Italian Domination Number of a Graph [PDF]
Discussiones Mathematicae Graph Theory, 2022 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 f(N[u]) ≥ 3.
Azvin Farzaneh, Rad Nader Jafari
doaj +2 more sources
Signed double Roman domination in graphs
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Abdollahzadeh Ahangar +1 more
exaly +5 more sources
Double Roman Graphs in P(3k, k)
Mathematics, 2021 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} with the properties that if f(u)=0, then vertex u is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and if f(u)=1, then vertex u is ...
Zehui Shao +5 more
doaj +2 more sources