نتایج جستجو برای: outer-independent double Italian domination
تعداد نتایج: 777298 فیلتر نتایج به سال:
An Italian dominating function on a (di)graph G with vertex set V ( ) is f : → { 0 , 1 2 } such that every v ∈ = has an (in)neighbour assigned or two (in)neighbours 1. We complete the investigation of domination numbers Cartesian products directed cycles.
We find the maximum number of edges for a graph of given order and value of parameter for several domination parameters. In particular, we consider the total domination and independent domination numbers.
4 In this paper, we study the domination number, the global dom5 ination number, the cographic domination number, the global co6 graphic domination number and the independent domination number 7 of all the graph products which are non-complete extended p-sums 8 (NEPS) of two graphs. 9
The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes ...
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...
Given a semigraph, we can construct graphs Sa, Sca, Se and S1e. In the same pattern, we construct bipartite graphs CA(S), A(S), VE(S), CA(S) and A(S). We find the equality of domination parameters in the bipartite graphs constructed with the domination and total domination parameters of the graphs Sa and Sca. We introduce the domination and independence parameters for the bipartite semigraph. W...
The domination number γ(G), the independent domination number ι(G), the connected domination number γc(G), and the paired domination number γp(G) of a graph G (without isolated vertices, if necessary) are related by the simple inequalities γ(G) ≤ ι(G), γ(G) ≤ γc(G), and γ(G) ≤ γp(G). Very little is known about the graphs that satisfy one of these inequalities with equality. I.E. Zverovich and V...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید