نتایج جستجو برای: italian dominating function
تعداد نتایج: 1255730 فیلتر نتایج به سال:
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
An Italian dominating function (IDF) of a graph G is f : V(G) → {0, 1, 2} satisfying the condition that for every v ∈ V with f(v) = 0, Σu∈N(v)f(u) ≥ 2. The weight an IDF on sum f(V) Σv∈Vf(v) and domination number, γI (G), minimum IDF. perfect (PID) G, if vertex 0 total assigned by to neighbours exactly 2, i.e., all u are except one which 2 or two vertices w f(w) 1. PID-function Σu∈V(G) f(u). nu...
A restrained Italian dominating function (RID-function) on a graph G=(V,E) is f:V→{0,1,2} satisfying: (i) f(N(u))≥2 for every vertex u∈V(G) with f(u)=0, where N(u) the set of vertices adjacent to u; (ii) subgraph induced by assigned 0 under f has no isolated vertices. The weight an RID-function sum its value over whole vertices, and domination number minimum G. In this paper, we initiate study ...
In a socio-economic scenario, which is constantly evolving, the enterprise should always renovate and modernise itself at all levels, in its internal organisation and in the markets where it operates. At the Italian level, the economic development of the country calls for a reorganisation of the economic activity as a whole effectiveness, productivity and managerial culture spread. This paper i...
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
A Roman dominating function (RDF) on a digraph $D$ is a function $f: V(D)rightarrow {0,1,2}$ satisfying the condition that every vertex $v$ with $f(v)=0$ has an in-neighbor $u$ with $f(u)=2$. The weight of an RDF $f$ is the value $sum_{vin V(D)}f(v)$. The Roman domination number of a digraph $D$ is the minimum weight of an RDF on $D$. A set ${f_1,f_2,dots,f_d}$ of Roman dominating functions on ...
A function f : V (G) → {−1, 0, 1} is a minus dominating function if for every vertex v ∈ V (G), ∑ u∈N [v] f(u) ≥ 1. A minus dominating function f of G is called a global minus dominating function if f is also a minus dominating function of the complement G of G. The global minus domination number γ− g (G) of G is defined as γ − g (G) = min{ ∑ v∈V (G) f(v) | f is a global minus dominating functi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید