نتایج جستجو برای: k rainbow domination number
تعداد نتایج: 1499647 فیلتر نتایج به سال:
for any integer $kgeq 1$, a set $s$ of vertices in a graph $g=(v,e)$ is a $k$-tuple total dominating set of $g$ if any vertex of $g$ is adjacent to at least $k$ vertices in $s$, and any vertex of $v-s$ is adjacent to at least $k$ vertices in $v-s$. the minimum number of vertices of such a set in $g$ we call the $k$-tuple total restrained domination number of $g$. the maximum num...
Let K n denote the Cartesian product Kn Kn Kn, where Kn is the complete graph on n vertices. We show that the domination number of K n is ⌈
Let G be a graph. A 2-rainbow dominating function (or 2-RDF) of G is a function f from V(G) to the set of all subsets of the set {1,2} such that for a vertex v ∈ V (G) with f(v) = ∅, thecondition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled, wher NG(v) is the open neighborhoodof v. The weight of 2-RDF f of G is the value$omega (f):=sum _{vin V(G)}|f(v)|$. The 2-rainbowd...
New results on singleton rainbow domination numbers of generalized Petersen graphs P(ck,k) are given. Exact values established for some infinite families, and lower upper bounds with small gaps given in all other cases.
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید