نتایج جستجو برای: twin signed total roman domatic number
تعداد نتایج: 1876844 فیلتر نتایج به سال:
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
We investigate the apparent difficulty of finding domatic partitions in graphs using tools from computability theory. We consider nicely presented (i.e., computable) infinite graphs and show that even if the domatic number is known, there might not be any algorithm for producing a domatic partition of optimal size. However, we prove that smaller domatic partitions can be constructed if we restr...
For a positive integer k, a total {k}-dominating function of a digraph D is a function f from the vertex set V (D) to the set {0, 1, 2, . . . , k} such that for any vertex v ∈ V (D), the condition ∑ u∈N(v) f(u) ≥ k is fulfilled, where N(v) consists of all vertices of D from which arcs go into v. A set {f1, f2, . . . , fd} of total {k}-dominating functions of D with the property that ∑ d i=1 fi(...
Let D be a finite and simple digraph with vertex set V (D) and arc set A(D). A signed Roman dominating function (SRDF) on the digraph D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑ x∈N−[v] f(x) ≥ 1 for each v ∈ V (D), where N −[v] consists of v and all inner neighbors of v, and (ii) every vertex u for which f(u) = −1 has an inner neighbor v for which f(v) = 2. The w...
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 graph. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S. The total domatic number of a graph is the maximum number of total dominating sets which partition the vertex set of G. In this paper we would like to characterize the cubic graphs with total domatic number at least two.
For a positive integer k, a total {k}-dominating function of a graph G without isolated vertices is a function f from the vertex set V (G) to the set {0, 1, 2, . . . , k} such that for any vertex v ∈ V (G), the condition ∑ u∈N(v) f(u) ≥ k is fulfilled, where N(v) is the open neighborhood of v. The weight of a total {k}-dominating function f is the value ω(f) = ∑ v∈V f(v). The total {k}-dominati...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید