# Rainbow Domination and Related Problems on Some Classes of Perfect Graphs

Abstract : Let $k \in \mathbb {N}$ and let G be a graph. A function $f: V(G) \rightarrow 2^{[k]}$ is a rainbow function if, for every vertex x with $f(x)=\varnothing$f(x)=∅, $f(N(x)) =[k]$, where [k] denotes the integers ranging from 1 to k. The rainbow domination number $\gamma _{kr}(G)$ is the minimum of $\sum _{x \in V(G)} |f(x)|$ over all rainbow functions. We investigate the rainbow domination problem for some classes of perfect graphs.
Document type :
Conference papers
Domain :

Cited literature [28 references]

https://hal.inria.fr/hal-01446271
Contributor : Hal Ifip <>
Submitted on : Wednesday, January 25, 2017 - 4:53:25 PM
Last modification on : Monday, January 15, 2018 - 11:47:14 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 3:16:53 PM

### File

385217_1_En_9_Chapter.pdf
Files produced by the author(s)

### Citation

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang. Rainbow Domination and Related Problems on Some Classes of Perfect Graphs. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.121-134, ⟨10.1007/978-3-319-28678-5_9⟩. ⟨hal-01446271⟩

Record views