TY - GEN
T1 - Rainbow domination and related problems on some classes of perfect graphs
AU - Hon, Wing Kai
AU - Kloks, Ton
AU - Liu, Hsiang Hsuan
AU - Wang, Hung Lung
N1 - Publisher Copyright:
© IFIP International Federation for Information Processing 2016.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84955239972&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84955239972&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-28678-5_9
DO - 10.1007/978-3-319-28678-5_9
M3 - Conference contribution
AN - SCOPUS:84955239972
SN - 9783319286778
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 121
EP - 134
BT - Topics in Theoretical Computer Science -The 1st IFIP WG 1.8 International Conference, TTCS 2015, Revised Selected Papers
A2 - Hajiaghayi, Mohammad Taghi
A2 - Mousavi, Mohammad Reza
PB - Springer Verlag
T2 - 1st IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2015
Y2 - 26 August 2015 through 28 August 2015
ER -