نتایج جستجو برای: italian domatic number
تعداد نتایج: 1199845 فیلتر نتایج به سال:
Let D = (V,A) be a finite simple directed graph (shortly digraph) in which dD(v) ≥ 1 for all v ∈ V . A function f : V −→ {−1, 1} is called a signed total dominating function if ∑ u∈N−(v) f(u) ≥ 1 for each vertex v ∈ V . A set {f1, f2, . . . , fd} of signed total dominating functions on D with the property that ∑d i=1 fi(v) ≤ 1 for each v ∈ V (D), is called a signed total dominating family (of f...
Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-distance Roman dominating function on G is a labeling f : V (G) → {0, 1, 2} such that every vertex with label 0 has a vertex with label 2 within distance k from each other. A set {f1, f2, . . . , fd} of k-distance Roman dominating functions on G with the property that ∑d i=1 fi(v) ≤ 2 for each v ∈ V (G), is call...
This paper surveys some of the work that was inspired by Wagner’s general technique to prove completeness in the levels of the boolean hierarchy over NP and some related results. In particular, we show that it is DP-complete to decide whether or not a given graph can be colored with exactly four colors, where DP is the second level of the boolean hierarchy. This result solves a question raised ...
An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simpli es and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NP-complete for several families of perfect graphs, including chordal and bipartite graphs.
Let G be a finite and simple graph with vertex set V (G), and let f : V (G) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and ∑ x∈N(v) f(x) ≥ k for each v ∈ V (G), where N(v) is the neighborhood of v, then f is a signed total k-dominating function on G. A set {f1, f2, . . . , fd} of distinct signed total k-dominating functions on G with the property that ∑d i=1 fi(x) ≤ j for each x...
Let D be a finite and simple digraph with vertex set V (D), and let f : V (D) → {−1, 1} be a two-valued function. If k ≥ 1 is an integer and x∈N−[v] f(x) ≥ k for each v ∈ V (D), where N−[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set {f1, f2, . . . , fd} of distinct signed k-dominating functions on D with the property that ...
This paper surveys some of the work that was inspired by Wagner’s general technique to prove completeness in the levels of the boolean hierarchy over NP and some related results. In particular, we show that it is DP-complete to decide whether or not a given graph can be colored with exactly four colors, where DP is the second level of the boolean hierarchy. This result solves a question raised ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید