A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory

Abstract

Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1)), (u2, σ(u2)), ...(uk, σ(uk))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tuple with regard to H of G. If any two elements of σ − H do not have any distinct representation with regard to H, then this subset is called a fuzzy resolving set (FRS) and the smallest cardinality of this set is known as a fuzzy resolving number (FRN) and it is denoted by Fr(G). Similarly, consider a subset S such that for any u∈S, ∃v∈V − S, then S is called a fuzzy dominating set only if u is a strong arc. Now, again consider a subset F which is both a resolving and dominating set, then it is called a fuzzy resolving domination set (FRDS) and the smallest cardinality of this set is known as the fuzzy resolving domination number (FRDN) and it is denoted by Fγr(G) We have defined a few basic properties and theorems based on this FRDN and also developed an application for social network connection. Moreover, a few related statements and illustrations are discussed in order to strengthen the concept.