Search

Let Heff (Veff, Eeff) be a finite simple connected graph of order m with vertex set Veff and edge set Eeff. A dominating set S d s ⊆ V e f f is called an efficiently dominating set if, for every vertex u a ∈ V G ,   N G u a ∩ S d s = 1 —where NG [ua] denotes the closed neighborhood of the vertex ua. Using efficient domination techniques and labelling, we constructed the fuzzy network. An algorithm has been framed to encrypt and decrypt the secret information present in the network, and furthermore, the algorithm has been given in pseudocode. The mathematical modelling of a strong fuzzy network is defined and constructed to elude the burgeoning intruder. Using the study of the efficient domination of fuzzy graphs, this domination parameter plays a nuanced role in encrypting and decrypting the framed network. One of the main purposes of fuzzy networks is encryption, so one of our contributions to this research is to build a novel combinatorial technique to encrypt and decode the built-in fuzzy network with a secret number utilizing effective domination. An illustration with an appropriate secret message is provided along with the encryption and decryption algorithms. Furthermore, we continued this study in intuitionistic fuzzy networks. [ABSTRACT FROM AUTHOR]