نتایج جستجو برای: restrained roman domination number
تعداد نتایج: 1190158 فیلتر نتایج به سال:
we consider a dynamic domination problem for graphs in which an infinitesequence of attacks occur at vertices with guards and the guard at theattacked vertex is required to vacate the vertex by moving to a neighboringvertex with no guard. other guards are allowed to move at the same time, andbefore and after each attack and the resulting guard movements, the verticescontaining guards form a dom...
a function $f:v(g)rightarrow {-1,0,1}$ is a {em minusdominating function} if for every vertex $vin v(g)$, $sum_{uinn[v]}f(u)ge 1$. a minus dominating function $f$ of $g$ is calleda {em global minus dominating function} if $f$ is also a minusdominating function of the complement $overline{g}$ of $g$. the{em global minus domination number} $gamma_{g}^-(g)$ of $g$ isdefined as $gamma_{g}^-(g)=min{...
the broadcast domination number of the cartesian product of two cycles is completely determined.
Let D=(V(D),A(D)) be a finite, simple digraph and k positive integer. A function f:V(D)→{0,1,2,…,k+1} is called [k]-Roman dominating (for short, [k]-RDF) if f(AN−[v])≥|AN−(v)|+k for any vertex v∈V(D), where AN−(v)={u∈N−(v):f(u)≥1} AN−[v]=AN−(v)∪{v}. The weight of [k]-RDF f ω(f)=∑v∈V(D)f(v). minimum on D the domination number, denoted by γ[kR](D). For k=2 k=3, we call them double Roman number tr...
This paper is devoted to the study of quadruple Roman domination in trees, and it a contribution Special Issue “Theoretical computer science discrete mathematics” Symmetry. For any positive integer k, [k]-Roman dominating function ([k]-RDF) simple graph G from vertex set V {0,1,2,…,k+1} if for u?V with f(u)<k, ?x?N(u)?{u}f(x)?|{x?N(u):f(x)?1}|+k, where N(u) open neighborhood u. The weight [k...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید