Bounding the rainbow domination number of a tree in terms of its annihilation number
A {em 2-rainbow dominating function} (2RDF) of 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 for any vertex $vin V(G)$ with $f(v)=emptyset$ the condition $bigcup_{uin N(v)}f(u)={1,2}$ is fulfilled, where $N(v)$ is the open neighborhoo...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
University of Isfahan
2013-09-01
|
| Ráidu: | Transactions on Combinatorics |
| Fáttát: | |
| Liŋkkat: | http://www.combinatorics.ir/?_action=showPDF&article=3051&_ob=dc39b3b99937a3eea4c41cc51272e53a&fileName=full_text.pdf. |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|