Let G = (V, E) be a graph. A function g : V → [0, 1] is called a global dominating function (GDF ) of G, if for every v ∈ V, g(N [v]) = ∑ u∈N [v] g(u) ≥ 1 and g(N(v)) = ∑ u/ ∈N(v) g(u) ≥ 1. A GDF g of a graph G is called minimal (MGDF ) if for all functions f : V → [0, 1] such that f ≤ g and f(v) 6= g(v) for at least one v ∈ V , f is not a GDF . The fractional global domination number γfg(G) is...

This paper considers the problem of global practical tracking via output feedback control for a class of more general uncertain high-order nonlinear systems. Under a weaker growth condition, by introducing sign function and necessarily modifying the homogeneous domination approach, this paper proposes a new control scheme to achieve the global practical tracking. It is shown that the designed c...

A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locatingdominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number λ(G). An LD-set S of a graph G is global if it is an LD-set of both G and its compleme...

In this paper we introduced the concepts of global domination number and domatic in product fuzzy graph is denoted by γg(G) dg(G), respectively determine for several classes obtain Nordhaus-Gaddum type results parameter. Further, some bounds dg(G) are investigated. Also relations between γg(G)(dg(G)) other known parameter Product graphs Finally introduce concept full about done.