A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
An independent 2-rainbow dominating function (I$2$-RDF) on a graph $G$ is a function $f$ from the vertex set $V(G)$ to the set of all subsets of the set $\{1,2\}$ such that $\{x\in V\mid f(x)\neq \emptyset \}$ is an independent set of $G$ and for any vertex $v\in V(G)$ with $f(v)=\emptyset $ we h...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2020-12-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v28-n3/v28-n3-(pp373-388).pdf |