The Roman domination and domatic numbers of a digraph
Let $D$ be a simple digraph with vertex set $V$. A Roman dominating function (RDF) on a digraph $D$ is a function $f: V\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $v$ with $f(v)=0$ has an in-neighbor $u$ with $f(u)=2$. The weight of an RDF $f$ is the value $\sum_{v\in V}f(v)...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Azarbaijan Shahide Madani University
2019-06-01
|
| Series: | Communications in Combinatorics and Optimization |
| Subjects: | |
| Online Access: | http://comb-opt.azaruniv.ac.ir/article_13841_9bb2c1e1cb7db1916a327f1866d037b2.pdf |