نتایج جستجو برای: signed k domination number
تعداد نتایج: 1501556 فیلتر نتایج به سال:
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 ⌈
1)فرض کنید g=(v,e) یک گراف ساده باشد.همسا یگی بسته رأس v?v را بصورت زیر نشان می دهیم : n[v]={u:uv?e}?{v} 2)تابعf:v?{-1,1} را تابع غالب علامت دار(signed dominating function یا به اختصار s.d.f) نامیم هرگاه به ازای هر v?v داشته باشیم f[v]=?_(u?n[v])?f(u) ?1:. 3)وزنfکه یکsdfمی باشد به صورت مقابل تعریف می شود: f(g)=?_(v?v)?f(v) . 4)می نیمم وزن تابع غالب علامتدار تعریف شده روی گراف g را با نماد?_s ...
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
This paper is motivated by the concept of nonnegative signed domination that was introduced by Huang, Li, and Feng in 2013 [15]. We study the non-negative signed domination problem from the theoretical point of view. For networks modeled by strongly chordal graphs and distance-hereditary graphs, we show that the non-negative signed domination problem can be solved in polynomial time. For networ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید