Results 11 to 20 of about 98,924 (189)
Perfect double Roman domination of trees
Discrete Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teresa W Haynes
exaly +5 more sources
Double Roman and double Italian domination
Discussiones Mathematicae Graph Theory, 2023 Summary: Let \(G\) be a graph with vertex set \(V(G)\). A double Roman dominating function (DRDF) on a graph \(G\) is a function \(f:V(G)\longrightarrow\{0,1,2,3\}\) that satisfies the following conditions: (i) If \(f(v)=0\), then \(v\) must have a neighbor \(w\) with \(f(w)=3\) or two neighbors \(x\) and \(y\) with \(f(x)=f(y)=2\); (ii) If \(f(v)=1\),
Lutz Volkmann
doaj +3 more sources
Restrained double Roman domination of a graph [PDF]
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
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 ∈ N(v) having f(x)=f(y ...
M. Kheibari +3 more
doaj +2 more sources
Some Properties of Double Roman Domination [PDF]
Discrete Dynamics in Nature and Society, 2020 A double Roman dominating function on a graph G is a function f:VG⟶0,1,2,3 satisfying the conditions that every vertex u for which fu=0 is adjacent to at least one vertex v for which fv=3 or two vertices v1 and v2 for which fv1=fv2=2 and every vertex u ...
Hong Yang, Xiaoqing Zhou
doaj +3 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
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. Here feasibility is given whenever (i) vertices labeled $\pm{}1$ have at least one neighbor with label in $\{2,3\}$; (ii) each ...
Enrico Iurlano +3 more
openaire +4 more sources
Total double Roman domination in graphs [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:V\rightarrow\{0,1,2,3\}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one ...
Guoliang Hao +2 more
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 +2 more
exaly +4 more sources
More results on the signed double Roman domination number of graphs
AKCE International Journal of Graphs and CombinatoricsA signed double Roman dominating function (SDRD-function) on a graph G is defined as a function [Formula: see text] having the property that [Formula: see text] for each [Formula: see text] and if [Formula: see text], then the vertex u must have a ...
Seyed Mahmoud Sheikholeslami +1 more
doaj +2 more sources