Results 21 to 30 of about 2,551 (252)
The double Roman domination number of generalized Sierpiński graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2020 In this paper, we study the double Roman domination number of generalized Sierpiński graphs [Formula: see text]. More precisely, we obtain a bound for the double Roman domination number of [Formula: see text]. We also find the exact value of [Formula: see text].
Anu V., S. Aparna Lakshmanan
openaire +3 more sources
DOUBLE ROMAN DOMINATION NUMBER OF MIDDLE GRAPH
South East Asian J. of Mathematics and Mathematical Sciences, 2022 For any graph G(V, E), a function f : V (G) 0, 1, 2, 3 is called Double Roman dominating function (DRDF) if the following properties holds, If f (v) = 0, then there exist two vertices v1, v2 ∈ N (v) for which f (v1) = f (v2) = 2 or there exist one vertex u ∈ N (v) for which f (u) = 3.∈ If f (v) = 1, then there exist one vertex u N (v) for which
Shirkol, Shailaja S. +2 more
openaire +3 more sources
On the double Roman domination in graphs [PDF]
Discrete Applied Mathematics, 2017 summary:For a graph $G=(V,E)$, a double Roman dominating function is a function $f\colon V\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$ under $f$ or one neighbor with $f(w)
Hossein Abdollahzadeh Ahangar +1 more
exaly +3 more sources
Bounds on the Double Italian Domination Number of a Graph
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 on cubic graphs [PDF]
Applied Mathematics and Computation, 2023 The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized.
E. Iurlano +3 more
semanticscholar +5 more sources
A note on the double Roman domination number of graphs
Czechoslovak Mathematical Journal, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue-gang Chen
semanticscholar +4 more sources
Restrained double Roman domination of a graph [PDF]
RAIRO Oper. Res., 2021 For a graph $G=(V,E)$, a restrained double Roman dominating function is a function $f:V\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$ under $f$ or one neighbor $w$ with $f(
D. Mojdeh, Iman Masoumi, L. Volkmann
semanticscholar +2 more sources
Lower and upper bounds on independent double Roman domination in trees
Electronic Journal of Graph Theory and Applications, 2022 For a graph G = ( V, E ) , a double Roman dominating function (DRDF) f : V → { 0 , 1 , 2 , 3 } has the property that for every vertex v ∈ V with f ( v ) = 0 , either there exists a neighbor u ∈ N ( v ) , with f ( u ) = 3 , or at least two neighbors x, y ∈
M. Kheibari +3 more
semanticscholar +3 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
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +2 more sources