نتایج جستجو برای: minus domination in graphs
تعداد نتایج: 17005600 فیلتر نتایج به سال:
A function f defined on the vertices of a graph G = (V ,E), f : V → {−1, 0, 1} is a total minus dominating function (TMDF) if the sum of its values over any open neighborhood is at least one. The weight of a TMDF is the sum of its function values over all vertices. The total minus domination number, denoted by −t (G), of G is the minimum weight of a TMDF on G. In this paper, a sharp lower bound...
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...
A two-valued function f defined on the vertices of a graph G = (V,E), f : V → {−1, 1}, is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. That is, for every v ∈ V, f(N(v)) ≥ 1, where N(v) consists of every vertex adjacent to v. The weight of a total signed dominating function is f(V ) = ∑ f(v), over all vertices v ∈ V . The total ...
A function f :V (G) → {−1, 0, 1} defined on the vertices of a graph G is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. An MTDF f is minimal if there does not exist an MTDF g:V (G) → {−1, 0, 1}, f = g, for which g(v) f (v) for every v ∈ V (G). The weight of an MTDF is the sum of its function values over all vertices. The mi...
Let G = (V,E) be a graph. A subset S of V is called a dominating set if each vertex of V −S has at least one neighbor in S. The domination number γ(G) equals the minimum cardinality of a dominating set in G. A minus dominating function on G is a function f : V → {−1, 0, 1} such that f(N [v]) = ∑ u∈N [v] f(u) ≥ 1 for each v ∈ V , where N [v] is the closed neighborhood of v. The minus domination ...
A three-valued function f defined on the vertices of a graph G = ( V, E), f : V 4 {-I. 0. I }, is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every 1~ t V, ,f(N[o]) > 1, where N[c] consists of I: and every vertex adjacent to 1’. The weight of a minus dominating function is f(V) = c f(u), over all vertices L: t V. The m...
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید