Signed total Roman $k$-domination in directed graphs
Let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Roman $k$-dominating function (STR$k$DF) on $D$ is a function $f:V(D)\rightarrow\{-1, 1, 2\}$ satisfying the conditions that (i) $\sum_{x\in N^{-}(v)}f(x)\ge k$ for each $v\in V(D)$, where $N^{-}(v)$ cons...
Main Authors: | N. Dehgard, L. Volkmann |
---|---|
Format: | Article |
Language: | English |
Published: |
Azarbaijan Shahide Madani University
2016-06-01
|
Series: | Communications in Combinatorics and Optimization |
Subjects: | |
Online Access: | http://comb-opt.azaruniv.ac.ir/article_13576.html |
Similar Items
-
Weak signed Roman k-domination in digraphs
by: Lutz Volkmann
Published: (2024-01-01) -
The Signed Total Roman k-Domatic Number Of A Graph
by: Volkmann Lutz
Published: (2017-11-01) -
Complexity of signed total $k$-Roman domination problem in graphs
by: Saeed Kosari, et al.
Published: (2021-11-01) -
Signed Total Roman Edge Domination In Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-11-01) -
Nonnegative signed total Roman domination in graphs
by: Nasrin Dehgardi, et al.
Published: (2020-12-01)