
Weak Signed Roman Domination in Digraphs
Author(s) -
Lutz Volkmann
Publication year - 2021
Publication title -
tamkang journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 18
eISSN - 0049-2930
pISSN - 2073-9826
DOI - 10.5556/j.tkjm.52.2021.3523
Subject(s) - digraph , combinatorics , mathematics , vertex (graph theory) , domination analysis , function (biology) , discrete mathematics , graph , evolutionary biology , biology
Let $D$ be a finite and simple digraph with vertex set $V(D)$. A weak signed Roman dominating function (WSRDF) on a digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2\}$ satisfying the condition that $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consists of $v$ and allvertices of $D$ from which arcs go into $v$. The weight of a WSRDF $f$ is $\sum_{v\in V(D)}f(v)$. The weak signed Roman domination number $\gamma_{wsR}(D)$ of $D$ is the minimum weight of a WSRDF on $D$. In this paper we initiate the study of the weak signed Roman domination number of digraphs, and we present different bounds on $\gamma_{wsR}(D)$. In addition, we determine the weak signed Roman domination number of some classesof digraphs.