Abstract
Let k ∈ N and let G be a graph. A function f: V (G) → 2[k] is a rainbow function if, for every vertex x with f(x) = ∅, f(N(x)) = [k], where [k] denotes the integers ranging from 1 to k. The rainbow domination number γkr(G) is the minimum of Σx∈V(G) |f(x)| over all rainbow functions. We investigate the rainbow domination problem for some classes of perfect graphs.
Cite
CITATION STYLE
Hon, W. K., Kloks, T., Liu, H. H., & Wang, H. L. (2016). Rainbow domination and related problems on some classes of perfect graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9541, pp. 121–134). Springer Verlag. https://doi.org/10.1007/978-3-319-28678-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
