نتایج جستجو برای: Roman domination
تعداد نتایج: 20909 فیلتر نتایج به سال:
Let k ∈ Z +. A − distance Roman dominating function (kDRDF) on G = (V, E) is a f : V → {0, 1, 2} such that for every vertex v with f(v) 0, there u f(u) 2 d(u, v) ≤ k. The global (GkDRDF) if and only its complement G. weight of the value w(f) P x∈V f(x). minimum graph called domination number denoted as γ gR(G). gR(G) Note that, 1 usual γgR(G), is, γgR(G). authors initiated this study. In paper,...
Let G = ( V, E ) be a simple graph with vertex setxs V and edge set . A mixed Roman dominating function of is f : ∪ → {0, 1, 2} satisfying the condition that every element x ∈ for which f(x) 0 adjacent or incident to at least one y f(y) 2. The weight ω( ∑ domination number γ R minimum We first show problem computing * NP-complete bipartite graphs then we present upper lower bounds on number, so...
When we examine the stories of women leaders in the early church—especially the stories of their actions for alleviating suffering—their teaching on the causes of suffering comes into focus: ignorance and fear which are the root of alienation, isolation, and divisions among people and from the earth. Ignorance and fear also manifest in patterns of social injustice and in organized systems of op...
An outer-independent double Roman dominating function (OIDRDF) of a graph G is h:V(G)→{0,1,2,3}</...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید