An Improved Algorithm for Identification of Dominating Vertex Set in Intuitionistic Fuzzy Graphs

Abstract

In graph theory, a “dominating vertex set” is a subset of vertices in a graph such that every vertex in the graph is either a member of the subset or adjacent to a member of the subset. In other words, the vertices in the dominating set “dominate” the remaining vertices in the graph. Dominating vertex sets are important in graph theory because they can help us understand and analyze the behavior of a graph. For example, in network analysis, a set of dominant vertices may represent key nodes in a network that can influence the behavior of other nodes. Identifying dominant sets in a graph can also help in optimization problems, as it can help us find the minimum set of vertices that can control the entire graph. Now that there are theories about vagueness, it is important to define parallel ideas in vague structures, such as intuitionistic fuzzy graphs. This paper describes a better way to find dominating vertex sets (DVSs) in intuitive fuzzy graphs (IFGs). Even though there is already an algorithm for finding DVSs in IFGs, it has some problems. For example, it does not take into account the vertex volume, which has a direct effect on how DVSs are calculated. To address these limitations, we propose a new algorithm that can handle large-scale IFGs more efficiently. We show how effective and scalable the method is by comparing it to other methods and applying it to water flow. This work’s contributions can be used in many areas, such as social network analysis, transportation planning, and telecommunications.