Rainbow Domination and Related Problems on Some Classes of Perfect Graphs - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
385217_1_En_9_Chapter.pdf (372.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01446271 , version 1 (25-01-2017)

Licence

Attribution

Identifiers

Cite

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⟩
97 View
76 Download

Altmetric

Share

Gmail Facebook X LinkedIn More