Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs

Abstract

In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced. In the current work, the triple-connected total perfect dominating set is modified to an n-connected total perfect k-dominating set nctpkD(G) and number γnctpD(G). New definitions are compared with old ones. Strong and weak n-connected total perfect k-dominating set and number of fuzzy graphs are obtained. The results of those fuzzy sets are discussed with the definitions of spanning fuzzy graphs, strong and weak arcs, dominating sets, perfect dominating sets, generalization of triple-connected total perfect dominating sets of fuzzy graphs, complete, connected, bipartite, cut node, tree, bridge and some other new notions of fuzzy graphs which are analyzed with a strong and weak nctpkD(G) set of fuzzy graphs. The order and size of the strong and weak nctpkD(G) fuzzy set are studied. Additionally, a few related theorems and statements are analyzed.

Strong Regular Domination in Litact Graphs

“…It was E. Sampath kumar who first proposed the concept of regular domination number. Numerous scholars have investigated these ideas, including (1,2,3,6,7) .…”

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

“…Later, it was developed by many researchers. A fuzzy graph is represented by giving a membership value to all the vertices and edges of a graph [14]. An application of fuzzy sets includes traffic light problems, network theory, mathematical biology, identification of drugs, cancer detection, examination schedules, and image capturing.…”