The k-Rainbow Bondage Number of a Digraph
Let D = (V,A) be a finite and simple digraph. A k-rainbow dominating function (kRDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v ∈ V with f(v) = Ø the condition ∪u∈N−(v) f(u) = {1, 2, . . . , k} is fulfilled,...
Wedi'i Gadw mewn:
| Prif Awduron: | , , , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
University of Zielona Góra
2015-05-01
|
| Cyfres: | Discussiones Mathematicae Graph Theory |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.7151/dmgt.1797 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|