Results 141 to 150 of about 184 (171)

Outer independent signed double Roman domination

Journal of Applied Mathematics and Computing, 2021
Suppose $$[3]=\{0,1,2,3\}$$ and $$[3^{-}]=\{-1,1,2,3\}$$ . An outer independent signed double Roman dominating function (OISDRDF) of a graph
Seyed Mahmoud Sheikholeslami, Sheikholeslami S M, Chellali M   +2 more
exaly   +2 more sources

Bounds for signed double Roman k-domination in trees [PDF]

RAIRO - Operations Research, 2019
Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V(G). A signed double Roman k-dominating function (SDRkDF) on a graph G is a function f:V(G) → {−1,1,2,3} such that (i) every vertex v with f(v) = −1 is adjacent to at least two vertices assigned a 2 or to at least one vertex w with f(w) = 3, (ii) every vertex v with f(v) = 1 is
Hong Yang, Pu Wu, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Xiaosong Zhang 0001, Zehui Shao, Yuan Yan Tang   +6 more
openaire   +2 more sources

Signed double Roman domination numbers in digraphs

Annals of the University of Craiova - Mathematics and Computer Science Series, 2021
"Let $D=(V,A)$ be a finite simple digraph. A signed double Roman dominating function (SDRD-function) on the digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2, 3\}$ satisfying the following conditions: (i) $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consist of $v$ and all in-neighbors of $v$, and (ii) if $f(v)=-1$, then the ...
Jafar Amjadi, Fatemeh Pourhosseini
openaire   +1 more source