Isolate g-eccentric domination in fuzzy graph

In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-eccentric vertex a of every vertex b in P − D exists in D. If the induced fuzzy sub graphhas at least one isolated vertex, then a g-eccentric dominating set D of G is said to be an isolate g-eccentric dominating set. The isolate g-eccentric domination number is defined as the smallest cardinality over all isolate g-eccentric dominating sets of G. This article introduces the isolate g-eccentric point set, isolate g-eccentric dominating set, and their numbers in fuzzy graphs. In some standard fuzzy graphs, bounds are found for an isolate g-eccentric domination number.