An overview of SSP structures in dragon graphs and domination and independent domination fuzzy SSP graphs

Abstract

Social network modeling is one of the many applications of dominant sets in graph theory. Social networks are made up of personalities or sets of individuals linked by relationships; graph theory provides a useful framework for examining and simulating these structures. We have already covered the idea of domination and how to calculate the domination numeral for various fuzzy graphs. Unlike anything found in the literature to date, we presented the idea of domination of fuzzy SSP graphs in this study. It is also spoken about the several super strongly perfect (SSP) structural parameters in fuzzy SSP graphs. The study appears to contribute to the ground of theory of graphs by extending the notion of domination to fuzzy SSP graphs. The paper also covers how to acquire specific dominant sets, coloring numbers, and cliques (maximal) in the context of fuzzy SSP graphs. In these kinds of scenarios, researchers can employ the following broad techniques to identify dominating sets.