Weak signed Roman k-domination in digraphs
Let \(k\geq 1\) be an integer, and let \(D\) be a finite and simple digraph with vertex set \(V(D)\). A weak signed Roman \(k\)-dominating function (WSRkDF) on a digraph \(D\) is a function \(f \colon V(D)\rightarrow \{-1,1,2\}\) satisfying the condition that \(\sum_{x \in N^-[v]}f(x)\geq k\) for ea...
Main Author: | Lutz Volkmann |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2024-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | https://www.opuscula.agh.edu.pl/vol44/2/art/opuscula_math_4414.pdf |
Similar Items
Similar Items
-
The signed Roman domatic number of a digraph
by: Seyed Mahmoud Sheikholeslami, et al.
Published: (2015-03-01) -
Weak signed Roman domination in graphs
by: Lutz Volkmann
Published: (2020-12-01) -
Signed total Roman $k$-domination in directed graphs
by: N. Dehgard, et al.
Published: (2016-06-01) -
The Signed Total Roman k-Domatic Number Of A Graph
by: Volkmann Lutz
Published: (2017-11-01) -
Bounds on the Signed Roman k-Domination Number of a Digraph
by: Chen Xiaodan, et al.
Published: (2019-02-01)