Results 11 to 20 of about 85,053 (298)
Double Roman domination and domatic numbers of graphs [PDF]
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
Calculating Modern Roman Domination of Fan Graph and Double Fan Graph [PDF]
This paper is concerned with the concept of modern Roman domination in graphs. A Modern Roman dominating function on a graph is labeling such that every vertex with label 0 is adjacent to two vertices; one of them of label 2 and the other of label 3 and ...
Saba Salah, Ahmed Omran, Manal Al-Harere
doaj +2 more sources
Restrained double Roman domination of a graph [PDF]
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
openalex +4 more sources
On the Outer-Independent Double Roman Domination of Graphs [PDF]
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
Maximal double Roman domination in graphs [PDF]
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 ...
H. Abdollahzadeh Ahangar +3 more
openalex +3 more sources
Signed double roman domination of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Ahangar Abdollahzadeh +2 more
openalex +4 more sources
Some Progress on the Double Roman Domination in Graphs
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 +2 more sources
The Restrained Double Roman Domination and Graph Operations
Let $G=(V(G),E(G))$ be a simple graph. A restrained double Roman dominating function (RDRD-function) of $G$ is a function $f: V(G) \rightarrow \{0,1,2,3\}$ satisfying the following properties: if $f(v)=0$, then the vertex $v$ has at least two neighbours assigned 2 under $f$ or one neighbour $u$ with $f(u)=3$; and if $f(v)=1$, then the vertex $v$ must ...
Zhipeng Gao, Changqing Xi, Jun Yue
openalex +4 more sources
Discharging Approach for Double Roman Domination in Graphs
The discharging method is most well-known for its central role in the proof of the Four Color Theorem. This proof technique was extensively applied to study various graph coloring problems, in particular on planar graphs.
Zehui Shao +5 more
doaj +2 more sources
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
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

