科研之友
微信
新浪微博
Facebook
分享链接
摘要
Assume we have a set of k colors and we assign an arbitrary subset of these colors to each vertex of a graph G. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this assignment is called the k-rainbow dominating function of a graph G. The minimum sum of numbers of assigned colors over all vertices of G, denoted as gamma(rk)(G), is called the k-rainbow domination number of G. In this paper, we prove that gamma(r2)(P(n, 3)) >= inverted right perpendicular 7n inverted left perpendicular.
