نتایج جستجو برای: italian domatic number
تعداد نتایج: 1199845 فیلتر نتایج به سال:
The domatic number d(G) of a graph G = (V,E) is the maximum order of a partition of V into dominating sets. Such a partition Π = {D1, D2, . . . , Dd} is called a minimal dominating d-partition if Π contains the maximum number of minimal dominating sets, where the maximum is taken over all d-partitions of G. The minimal dominating d-partition number Λ(G) is the number of minimal dominating sets ...
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) ...
Domination is a well-known graph theoretic concept due to its significant real-world applications in several domains, such as design and communication network analysis, coding theory, optimization. For connected ? = V , E ...
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 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(...
A signed Roman dominating function on the digraphD is a function f : V (D) −→ {−1, 1, 2} such that ∑ u∈N−[v] f(u) ≥ 1 for every v ∈ V (D), where N−[v] consists of v and all inner neighbors of v, and every vertex u ∈ V (D) for which f(u) = −1 has an inner neighbor v for which f(v) = 2. A set {f1, f2, . . . , fd} of distinct signed Roman dominating functions on D with the property that ∑d i=1 fi(...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید