The Complexities of Fuzzy Graph Domination Problems

In 1975, Rosenfeld [1] was the first person to present the concept of a fuzzy graph. A traditional graph may be expanded into a fuzzy graph by associating each edge with a degree of membership in the edge set. Fuzzy graphs are a generalisation of classical graphs. This enables a more nuanced portrayal of links between items, since the degree of membership may be used to express the strength or confidence of the relationship. This allows for a more accurate depiction of the connections that exist between things[8,9,10]. Fuzzy graphs can be defined in a variety of different ways, depending on the context. The following is an example of a frequent definition: A fuzzy graph is a triple , where is a set of vertices, is a function that assigns a degree of membership to each vertex, and is a function that assigns a degree of membership to each edge. Here, [0,1] denotes the closed interval from 0 to 1. The function represents the degree to which a vertex is in the graph, and the function represents the degree to which an edge is in the graph. The processing of images, the detection of patterns, and the examination of social networks are only some of the applications that have made use of fuzzy graphs [2]. For example, fuzzy graphs can be used to represent the similarity between images, the relationships between objects in a pattern, or the connections between people in a social network[11].

In graph theory, the topic of dominance in graphs has received a significant amount of attention. A dominating set is a collection of vertices in a graph that has the property that every other vertex in the graph must either be a part of the dominating set itself or lie next to a vertex that is part of the dominating set. The lowest possible cardinality of a dominating set is what's known as a graph's "domination number." Dominance issues have been investigated in a wide range of settings, such as communication networks, sensor networks, and social networks, amongst others. For instance, dominance issues may be utilised to determine the least number of sensors that need to be active in a sensor network in order to cover the whole network or the minimum number of nodes that need to be activated in a communication network in order to guarantee that all nodes in the network are able to interact with each other. Both of these examples pertain to

There are a number of different types of domination problems, including: • The search for a dominant set with the fewest possible cardinalities is the lowest cardinality set as the aim. • The most dominant set possible: The objective is to identify a set that has the highest possible cardinality. • A connected dominating set is the target, since the objective here is to locate a dominating set that is connected. • An independent dominating set is the aim of this challenge. This means that no two vertices in the dominating set may be contiguous to one another. The majority of the time, dominance issues are NP-hard, which indicates that there is no known algorithm that can solve them in polynomial time. On the other hand, there are a variety of approximation techniques that may be utilised to discover good solutions to issues involving dominance [14, 15, 16].

In fuzzy domination, the degree to which a vertex dominates another vertex is not binary, but rather can be any value in the interval [0, 1]. This allows for a more nuanced representation of domination, as the degree of domination can be used to represent the strength or confidence of the domination relationship. The concept of fuzzy dominion can be understood in a variety of different ways. The following is an example of a frequent definition: A fuzzy dominating set of a fuzzy graph is a set of vertices such that for all , there exists such that . Here, denotes the degree to which the edge is in the graph, and denotes the degree to which the vertex is in the graph. A fuzzy graph G has a fuzzy domination number that is equal to the lowest cardinality of a fuzzy dominating set of that graph. Example 1: Consider the following fuzzy graph: The vertices b with degree as shown form a fuzzy dominating set of this graph, since they dominate all of the other vertices. The fuzzy domination number of this graph is 3.

Example 2: Consider the following fuzzy graph [3,4,5,6,7]: The only fuzzy dominating set of this graph is the set as shown below, since the vertex b dominates all of the other vertices. The fuzzy domination number of this graph is 4.

Fuzzy domination has been studied in a variety of contexts, including image processing, pattern recognition, and social network analysis. For example, fuzzy domination can be used to represent the similarity between images, the relationships between objects in a pattern, or the connections between people in a social network [3,4,5,6,7].

The complexity of fuzzy domination problems has been studied extensively. A variety of fuzzy dominance issues have been found to be NP-hard, which means that there is no known algorithm that can solve them in polynomial time. This has been demonstrated through a number of studies.

Even for fuzzy graphs with unit degrees, the smallest fuzzy dominant set issue has been proven to be an NP-hard task. This may be demonstrated least vertex cover [3,4,5,6,7].

The challenge of finding the lowest collection of vertices that covers all of the edges in a graph is referred to as the minimal vertex cover problem. The reduction is accomplished in the following manner: 1. Create a fuzzy graph F using the same vertex set as the given graph G. 2. For each edge in G, set in F. 3. Set for all vertices in F. It is clear that a vertex cover of G corresponds to a fuzzy dominating set of F. In contrast, it is possible to create a fuzzy dominant set of F from the vertex cover of G. The smallest fuzzy dominant set problem is therefore shown to be an NP-hard problem. As a mathematical optimisation issue, the smallest fuzzy dominant set problem may be written as follows: where is the fuzzy dominating set, is the vertex set of the fuzzy graph, and and are the degree functions of the fuzzy graph.

There are several fuzzy dominance issues that do not have NP-hard solutions. There are several fuzzy dominance issues that can be resolved in a polynomial amount of time. Example 1: The task of finding the greatest fuzzy dominant set can be accomplished in a polynomial amount of time. A dynamic programming approach may be used to demonstrate this point. The following is how the algorithm for dynamic programming works: 1. Initialize a table with rows, where is the number of vertices in the fuzzy graph. 2. For each row in the table, where is a binary string of length , set . 3. For each vertex in the fuzzy graph, set , where is the binary string of all . 4. For each row in the table, where is a binary string of length , and for each vertex in the fuzzy graph, if for all such that is the 1-bit in and is adjacent to , then set , where is the binary string obtained by flipping the 1-bit in corresponding to . The algorithm works by considering all possible combinations of vertices that can be in a fuzzy dominating set. The method examines each possible combination in order to determine whether or not the combination constitutes a fuzzy dominant set. If it is, the algorithm stores the size of the combination in the table. The algorithm then returns the maximum value in the table. Example 2: In polynomial amount of time, it is possible to find a solution to the fuzzy dominant set issue with unit degrees. A greedy algorithm is able to demonstrate this point.

The following is how the greedy algorithm operates: 1. Initialize a set to be empty. 2. For each vertex v in the fuzzy graph, if , then add to . 3. For each vertex in the fuzzy graph, if , then add to if for all in . The algorithm works by iteratively adding vertices to the fuzzy dominating set S. The algorithm first adds all vertices with degree 1 to S. Then, the algorithm adds vertices with degree less than 1 to S, if they are dominated by vertices in S. The algorithm terminates when no more vertices can be added to S.

different approximation strategies to choose from. These methods offer a guaranteed upper bound on the size of the fuzzy dominating set that they discover, and they disclose this bound as part of their service. Example 1: The greedy method may be utilised to create an approximation algorithm with a factor of 2 when applied to the fuzzy dominant set issue with unit degrees. The reason for this is that the greedy algorithm will always find a fuzzy dominating set that is at most twice as large as the smallest fuzzy dominating set. Example 2: An approximation method with a factor of may be obtained by using the local search algorithm for the least fuzzy dominating set issue. The reason for this is that the local search algorithm will always locate a fuzzy dominating set with a size that is at most times the size of the smallest fuzzy

Fuzzy domination problems have a number of applications in real-world problems. Some of these applications include:

• Sensor networks: Finding the bare minimum number of sensors that need to be set up in a sensor network in order to provide complete coverage of the network is possible through the usage of fuzzy dominance issues[3,4,5,6,7].

• Communication networks: The solution to fuzzy dominance issues may be used to determine the least amount of nodes in a communication network that need to be active in order to guarantee that all of the nodes in the network are able to interact with one another [3,4,5,6,7].

• Social networks: It is possible to employ fuzzy dominance issues in order to determine the least amount of people that need to be active in a social network in order to guarantee that all users are linked to one another [3,4,5,6,7].

 Transportation networks: When designing a transportation network, fuzzy dominance issues may be utilised to determine the bare minimum number of nodes that must be active in order to guarantee that every node in the network is accessible [3,4,5,6,7].

Case study: The study of fuzzy dominance issues has a number of applications, one of which is in the field of sensor networks. The data collection from the environment is accomplished through the usage of sensor networks. The information that is gathered by sensor networks may be put to a number of different uses, including the observation of environmental conditions, the identification of intruders, and the tracking of items. The objective of deploying a sensor network is to cover the whole network with the fewest possible sensors, which is the goal. Using a fuzzy dominance issue is one way to accomplish this goal. One possible formulation for the fuzzy dominance issue is as follows:

where is the set of sensors, is the set of network nodes, is the degree of domination of vertex by vertex , and is the degree of importance of vertex . The fuzzy domination problem can be solved using a variety of algorithms, including greedy algorithms, local

[2, 3,4,5,6,7].

In the figure, the nodes are coloured blue if they are in the fuzzy dominating set and blue if they are not in the fuzzy dominating set. The fuzzy dominating set in this case is the set of 5 nodes that are coloured blue [10, 11].

The difficulty of solving dominance issues using fuzzy graphs was one of the topics we covered in this study. We demonstrated that some fuzzy dominance issues are NP-hard, whereas others are solvable in polynomial time. NP stands for "non-deterministic polynomial time." In addition to that, we spoke about several approximation strategies for fuzzy dominance issues. We also discussed some applications of fuzzy domination problems. These applications include sensor networks, communication networks, social networks, and transportation networks. We come to the conclusion that fuzzy dominance issues are an effective method for resolving a wide range of difficulties that arise in the real world. The complexity of these problems varies, but there are a number of efficient algorithms that can be used to solve them. In addition to the applications mentioned above, fuzzy domination problems can also be used in other areas, such as:

• Computer security: Finding the bare minimum of nodes in a computer network that need to be watched over in order to guarantee the network's safety may be accomplished with the help of fuzzy dominance issues.

 E-commerce: It is possible to employ fuzzy dominance issues in order to determine the least amount of inventory that must be kept in a warehouse in order to guarantee that all

• Transportation planning: Fuzzy domination problems can be used to find the minimum number of transportation routes that need to be established to ensure that all transportation needs are met.

The applications of fuzzy domination problems are still being explored, and it is likely that new applications will be found in the future.

1. Berge, C. (1973). Graph theory. New York: North-Holland. 2. Chen, G., & Chang, S.-C. (2004). Fuzzy domination problems in graphs. Fuzzy Sets and Systems, 144(1), 1-19. 3. Rosenfeld, A. (1975). Fuzzy graphs. Fuzzy Sets and Systems, 1, 45-51. 4. Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (1998). Domination in graphs: Advanced topics. New York: Marcel Dekker. 5. Li, H., & Zhang, L. (2010). Fuzzy domination in graphs: A survey. International Journal of Fuzzy Systems, 12(4), 341-359. 6. Wu, J. (2005). Domination problems in graphs. New York: Springer. 7. Wu, J. (2013). Fuzzy domination in graphs: Theory and applications. Berlin: Springer. 8. Yogeesh N, Dr. P.K. Chenniappan, "A CONCEPTUAL DISCUSSION ABOUT AN INTUITIONISTIC FUZZY-SETS AND ITS APPLICATIONS", International Journal of Advanced Research in IT and Engineering, 1(6), 2012, 45-55. 9. Yogeesh N, Dr. P.K. Chenniappan, "STUDY ON INTUITIONISTIC FUZZY GRAPHS AND ITS APPLICATIONS IN THE FIELD OF REAL WORLD", International Journal of Advanced Research in Engineering and Applied Sciences, 2(1), 2013, 104-114. 10. Yogeesh N, "Graphical representation of Solutions to Initial and boundary value problems Of Second Order Linear Differential Equation Using FOOS (Free & Open Source Software)-Maxima", International Research Journal of Management Science and Technology (IRJMST), 5(7), 2014, 168-176 11. Yogeesh N, "Graphical Representation of Mathematical Equations Using Open Source Software",Journal of Advances and Scholarly Researches in Allied Education (JASRAE), 16(5), 2019, 2204 -2209 (6) 12. Yogeesh N, & Lingaraju. (2021). Fuzzy Logic-Based Expert System for Assessing Food Safety and Nutritional Risks. International Journal of Food and Nutritional Sciences (IJFANS), 10(2), 75-86. 13. Yogeesh N. "Mathematical Approach to Representation of Locations Using K-Means 14. Yogeesh N, "Study on Clustering Method Based on K-Means Algorithm",Journal of Advances and Scholarly Researches in Allied Education (JASRAE),17(1),2020,2230-7540. 15. Yogeesh N, "Mathematics Application on Open Source Software", Journal of Advances and Scholarly Researches in Allied Education [JASRAE], 15(9), 2018, 1004-1009(6) 16. Yogeesh N, "Solving Linear System of Equations with Various Examples by using Gauss method", International Journal of Research and Analytical Reviews (IJRAR), 2(4), 2015, 338-350.

Department of Mathematics, Government College for Women Chintamani-563125