Fuzzy sets and their variants
Sivasankar Shanmugam; Thirumal Perumal Aishwarya; Nagesh Shreya
Abstract
In communication networks, strong connectivity between nodes is critical. The failure of strong connectivity between nodes may jeopardize the network’s stability. In fuzzy graphs, various dominating sets using strong edges are identified to avoid network stability. In this paper, the concept of ...
Read More
In communication networks, strong connectivity between nodes is critical. The failure of strong connectivity between nodes may jeopardize the network’s stability. In fuzzy graphs, various dominating sets using strong edges are identified to avoid network stability. In this paper, the concept of bridge domination set and bridge domination number in fuzzy graphs is introduced. A few prominent properties of bridge domination numbers are chosen and analyzed using relevant examples. The bridge domination number of fuzzy trees, constant fuzzy cycles, and complete fuzzy and bipartite fuzzy graphs are identified. The use of bridge domination in a partial mesh topology to ensure network continuity is demonstrated in the event of a node failure.
Boolean-valued fuzzy sets and their variants
O. T Manjusha
Abstract
Sampathkumar [7] has been introduced the notion of global domination in graphs. Nagoorgani and Hussain [24] have introduced the concept of global domination in fuzzy graphs using effective arcs. This paper presents global domination in fuzzy graphs using strong arcs. The strong global domination number ...
Read More
Sampathkumar [7] has been introduced the notion of global domination in graphs. Nagoorgani and Hussain [24] have introduced the concept of global domination in fuzzy graphs using effective arcs. This paper presents global domination in fuzzy graphs using strong arcs. The strong global domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong global domination number of fuzzy graphs is obtained. Strong global domination in fuzzy trees is studied. It is established that every node of a strong global dominating set of a fuzzy tree is either a fuzzy cut node or a fuzzy end node. It is proved that in a fuzzy tree, each node of a strong global dominating set is incident on a fuzzy bridge. Also, the characteristic properties of the existence of a strong global dominating set for a fuzzy graph and its complement are established.
