نتایج جستجو برای: twin minus domination in digraphs
تعداد نتایج: 16986047 فیلتر نتایج به سال:
In this paper, we solve a problem by Glover and Punnen (1997) from the context of domination analysis, where the performance of a heuristic algorithm is rated by the number of solutions that are not better than the solution found by the algorithm, rather than by the relative performance compared to the optimal value. In particular, we show that for the Asymmetric Traveling Salesman Problem (ATS...
Let D be a finite and simple digraph with the vertex set V (D), and let f : V (D) → {−1, 1} be a two-valued function. If∑ x∈N[v] f(x) ≥ 1 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 dominating function on D. The sum f(V (D)) is called the weight w(f) of f . The minimum of weights w(f), taken over all signed dominating function...
In this paper, we give upper bounds on the upper signed domination number of [l, k] graphs, which generalize some results obtained in other papers. Further, good lower bounds are established for the minus ksubdomination number γ−101 ks and signed k-subdomination number γ −11 ks .
Let Y be a subset of real numbers. A Y dominating function of a graph G = (V, E) is a function f : V → Y such that u∈NG[v] f(u) ≥ 1 for all vertices v ∈ V , where NG[v] = {v} ∪ {u|(u, v) ∈ E}. Let f(S) = u∈S f(u) for any subset S of V and let f(V ) be the weight of f . The Y -domination problem is to find a Y -dominating function of minimum weight for a graph. In this paper, we study the variat...
Let k ≥ 1 be an integer, and let D = (V, A) be a finite and simple digraph in which dD(v) ≥ k for all v ∈ V . A function f : V −→ {−1, 1} is called a signed total k-dominating function (STkDF) if f(N−(v)) ≥ k for each vertex v ∈ V . The weight w(f) of f is defined by w(f) = ∑ v∈V f(v). The signed total k-domination number for a digraph D is γ kS(D) = min{w(f) | f is a STkDF of D}. In this paper...
Let G = (V,A) be a directed graph without parallel arcs, and let S ⊆ V be a set of vertices. Let the sequence S = S0 ⊆ S1 ⊆ S2 ⊆ · · · be defined as follows: S1 is obtained from S0 by adding all out-neighbors of vertices in S0. For k > 2, Sk is obtained from Sk−1 by adding all vertices w such that for some vertex v ∈ Sk−1, w is the unique out-neighbor of v in V \ Sk−1. We set M(S) = S0 ∪S1 ∪ · ...
We develop an O(n 3) algorithm for deciding if an n-vertex digraph has a subset of vertices with the property that each vertex of the graph has an even number of arcs into the subset. This algorithm allows us to give a combinatorial interpretation of Gauss-Jordan and Gauss elimination on square boolean matrices. In addition to solving this independence-mod-2 (even) set existence problem we also...
Recently, Hedetniemi et al. introduced (1, 2)-domination in graphs, and the authors extended that concept to (1, 2)-domination graphs of digraphs. Given vertices x and y in a digraph D, x and y form a (1, 2)-dominating pair if and only if for every other vertex z in D, z is one step away from x or y and at most two steps away from the other. The (1, 2)-dominating graph of D, dom1,2 (D) , is def...
postcolonial feminism, also dubbed as third world feminism, is an innovative approach, demonstrating the way women of colonized countries suffer from both native patriarchies and imperial ideology. also due to this double-colonization, postcolonial feminists contend that third world women are subjected to both colonial domination of empire and male domination of patriarchy. while western femini...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید