شماره ركورد كنفرانس :
4819
عنوان مقاله :
Rainbow domination of graphs
عنوان به زبان ديگر :
Rainbow domination of graphs
پديدآورندگان :
Mojdeh D.A. damojdeh@umz.ac.ir University of Mazandaran , Department of Mathematics , Mansouri Zh. mansoury.zh@yahoo.com University of Mazandaran , Department of Mathematics
كليدواژه :
Rainbow domination , independent rainbow domination , graphs.
عنوان كنفرانس :
سومين همايش بين المللي تركيبيات، رمزنگاري و محاسبات
چكيده فارسي :
Let G=(V,E) be a graph with the vertex set V=V(G) and the edge set E=E(G). Let k be a positive integer, [k]={1,2,…,k} and P([k]) be the power set of [k]. A function f:V(G)→P([k]) is a krainbow dominating function if for every vertex x with f(x)=\emptyset, f(N(x))=[k]. The k-rainbow domination number \lambda_rk(G) is the minimum weight ∑x∊ V(G) |f(x)| taken over all k-rainbow functions. We investigate the rainbow domination and independent rainbow domination numbers of classes of graphs
چكيده لاتين :
Let G=(V,E) be a graph with the vertex set V=V(G) and the edge set E=E(G). Let k be a positive integer, [k]={1,2,…,k} and P([k]) be the power set of [k]. A function f:V(G)→P([k]) is a krainbow dominating function if for every vertex x with f(x)=\emptyset, f(N(x))=[k]. The k-rainbow domination number \lambda_rk(G) is the minimum weight ∑x∊ V(G) |f(x)| taken over all k-rainbow functions. We investigate the rainbow domination and independent rainbow domination numbers of classes of graphs
