نتایج جستجو برای: signed total roman k dominating function
تعداد نتایج: 2266367 فیلتر نتایج به سال:
For a simple graph G=(V,E) with no isolated vertices, total Roman {3}-dominating function(TR3DF) on G is function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 f(v)=1; and (iii) every vertex v f(v)≠0 has neighbor u f(u)≠0 for v∈V(G). The weight of TR3DF f sum f(V)=∑v∈V(G)f(v) minimum called {3}-domination number denoted by γt{R3}(G). In this paper, we...
Let k~l be an integer, and let G = (V, E) be a graph. The closed kneighborhood N k[V] of a vertex v E V is the set of vertices within distance k from v. A 3-valued function f defined on V of the form f : V --+ { -1,0, I} is a three-valued k-neighborhood dominating function if the sum of its function values over any closed k-neighborhood is at least 1. The weight of a threevalued k-neighborhood ...
Let k ≥ j ≥ 1 be two integers, and letG be a simple graph such that j(δ(G)+1) ≥ k, where δ(G) is the minimum degree of G. A (j, k)-dominating function of a graph G is a function f from the vertex set V (G) to the set {0, 1, 2, . . . , j} such that for any vertex v ∈ V (G), the condition ∑ u∈N[v] f(u) ≥ k is fulfilled, where N [v] is the closed neighborhood of v. A set {f1, f2, . . . , fd} of (j...
The in-neighborhood, I(v), of a vertex v in a digraph D=(V, A) is v together with the set of all vertices sending an arc to v, i.e., vertices u such that (u, v) # A. A subset of V is called dominating if it meets I(v) for every v # V. (To avoid confusion, it must be noted that some authors require in the definition meeting every out-neighborhood.) A set of vertices is called independent if no t...
A set S of vertices of a graph G is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domination number t(G) is the minimum cardinality of a total dominating set of G. Let G be a connected spanning subgraph of Ks;s, and let H be the complement of G relative to Ks;s; that is, Ks;s = G ⊕ H is a factorization of Ks;s. The graph G is k-supercritical relative...
Domination theory is a well-established topic in graph theory, as well one of the most active research areas. Interest this area partly explained by its diversity applications to real-world problems, such facility location computer and social networks, monitoring communication, coding algorithm design, among others. In last two decades, functions defined on graphs have attracted attention sever...
We limit our discussion to graphs that are simple and finite of order . Although 8 we often identify a graph with its set of vertices, in cases where we need to be K explicit we write . A set of vertices of is said to Z ÐKÑ Q K dominate K provided each vertex of is either in or adjacent to a vertex of . K Q Q The domination number of is the minimum order of a dominating set. A K dominating prov...
Let be a simple graph with vertex set and edge set . Let have at least vertices of degree at least , where and b are positive integers. A function is said to be a signed -edge cover of G if G ( ) V G ( ) e E v ( ) E G G : ( f E k b k ) { 1,1} G ( , ) b k ( ) f e b for at least vertices of , where . The value k v G ( ) = {uv E( ( ) E v G u N v ) | } ( ) min ( ) G e E f e , taki...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید