点击次数：

论文类型：期刊论文

发表时间：2011-10-01

发表刊物：ARS COMBINATORIA

收录刊物：Scopus、SCIE

卷号：102

页面范围：483-492

ISSN号：0381-7032

关键字：Domination; 2-Rainbow domination; Generalized Petersen graph

摘要：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.