Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
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(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.
Domains
| Origin | Files produced by the author(s) |
|---|
Loading...
