Bridge domination in fuzzy graphs

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.