Total $k$-Rainbow domination numbers in graphs
Let $k\geq 1$ be an integer, and let $G$ be a graph. A {\it $k$-rainbow dominating function} (or a {\it $k$-RDF}) of $G$ is a function $f$ from the vertex set $V(G)$ to the family of all subsets of $\{1,2,\ldots ,k\}$ such that for every $v\in V(G)$ with $f(v)=\emptyset $, the co...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Azarbaijan Shahide Madani University
2018-01-01
|
| Series: | Communications in Combinatorics and Optimization |
| Subjects: | |
| Online Access: | http://comb-opt.azaruniv.ac.ir/article_13683.html |