Bounds on the Signed Roman k-Domination Number of a Digraph
Let k be a positive integer. A signed Roman k-dominating function (SRkDF) on a digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) Σx∈N−[v]f(x) ≥ k for each v ∈ V (D), where N−[v] is the closed in-neighborhood of v, and (ii) each vertex u for which f(u) = −1 has an in-n...
Main Authors: | Chen Xiaodan, Hao Guoliang, Volkmann Lutz |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2019-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2068 |
Similar Items
-
Signed Total Roman Domination in Digraphs
by: Volkmann Lutz
Published: (2017-02-01) -
Signed Roman Edge k-Domination in Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-02-01) -
A Note on Roman Domination of Digraphs
by: Chen Xiaodan, et al.
Published: (2019-02-01) -
The signed Roman domatic number of a digraph
by: Seyed Mahmoud Sheikholeslami, et al.
Published: (2015-03-01) -
The Double Roman Domatic Number of a Digraph
by: Volkmann Lutz
Published: (2020-11-01)