نتایج جستجو برای: minus k dominating function
تعداد نتایج: 1554817 فیلتر نتایج به سال:
a roman dominating function (rdf) on a graph g = (v,e) is defined to be a function satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. a set s v is a restrained dominating set if every vertex not in s is adjacent to a vertex in s and to a vertex in . we define a restrained roman dominating function on a graph g = (v,e) to be ...
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
Let G be a simple graph without isolated vertices with vertex set V (G) and edge set E(G) and let k be a positive integer. A function f : E(G) → {−1, 1} is said to be a signed star k-dominating function on G if ∑ e∈E(v) f(e) ≥ k for every vertex v of G, where E(v) = {uv ∈ E(G) | u ∈ N(v)}. A set {f1, f2, . . . , fd} of signed star k-dominating functions on G with the property that ∑d i=1 fi(e) ...
For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v ∈ V (G) with f(v) = ∅ the condition ⋃ u∈N(v) f(u) = {1, 2, . . . , k} is fulfilled, where N(v) is the neighborhood of v. The 1-rainbow domination is the same as the ordinary domination. A set {f1, f2, ....
In this paper, we study the Dominating Set problem in random graphs. In a random graph, each pair of vertices are joined by an edge with a probability of p, where p is a positive constant less than 1. We show that, given a random graph in n vertices, a minimum dominating set in the graph can be computed in expected 2 2 2 n) time. For the parameterized dominating set problem, we show that it can...
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
We develop the plus/minus p-Selmer group theory and plus/minus padic L-function theory for an elliptic curve E with complex multiplication over an abelian extension F of the imaginary quadratic field K given by the complex multiplication of E when p is a prime inert over K/Q (i.e. supersingular). As a result, we prove that the characteristic ideal of the Pontryagin dual of the plus/minus p-Selm...
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a dominating set of size at most g(k), where g(k) is some fixed function of k. Such an outcome is termed an FPT approximation algorithm. We describe some results that begin to provide some answers. We show that there is n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید