Results 1 to 10 of about 64,476 (206)
Independent double Roman domination in graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at ...
H. R. Maimani +3 more
doaj +4 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 +4 more sources
An improved upper bound on the independent double Roman domination number of trees
AKCE International Journal of Graphs and Combinatorics, 2022 For a graph [Formula: see text] an independent double Roman dominating function (IDRDF) is a function [Formula: see text] having the property that: (i) every vertex [Formula: see text] with f(v) = 0 has a neighbor u with f(u) = 3 or at least two ...
F. Nahani Pour +3 more
doaj +4 more sources
On the Outer Independent Double Roman Domination Number [PDF]
Bulletin of the Iranian Mathematical Society, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh +3 more
exaly +5 more sources
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
Mathematics, 2022 In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f is an assignment such that every vertex assigned 0 has at least one neighbor assigned 2 and all vertices labeled by 0 are independent, then f is called an outer independent Roman dominating ...
Hong Gao +3 more
doaj +2 more sources
Independent Double Roman Domination in Graphs
Bulletin of the Iranian Mathematical Society, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maimani, Hamidreza +4 more
exaly +5 more sources
On the Independent Double Roman Domination in Graphs [PDF]
Bulletin of the Iranian Mathematical Society, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh, Zhila Mansouri
openaire +4 more sources
Further results on independent double roman trees
AKCE International Journal of Graphs and Combinatorics, 2022 A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v
A. Rahmouni +3 more
doaj +1 more source
On the Outer Independent Total Double Roman Domination in Graphs
Mediterranean Journal of Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H. +3 more
openaire +3 more sources
Lower and upper bounds on independent double Roman domination in trees
Electronic Journal of Graph Theory and Applications, 2022 Summary: For a graph \(G = (V, E)\), a double Roman dominating function (DRDF) \(f : V \rightarrow \{0, 1, 2, 3\}\) has the property that for every vertex \(v\in V\) with \(f(v)=0\), either there exists a neighbor \(u \in N(v)\), with \(f(u)=3\), or at least two neighbors \(x, y \in N(v)\) having \(f(x)=f(y)=2\), and every vertex with value 1 under \(f\
Kheibari, M. +3 more
openaire +2 more sources