Exploring domination in strongly connected product fuzzy digraphs: an optimised perspective
摘要
Network optimisation is essential for contemporary communication systems, which seek to improve network performance, reliability, and efficiency. In this paper, we study the domination number of strongly connected fuzzy digraphs and establish certain bounds. Furthermore, we extend our study by introducing the maximal and co-normal product operations and their properties using the strongly connected product fuzzy digraph. We analyse the efficiency of the maximal and co-normal products of a strongly connected product fuzzy digraph using the domination number, minimal arborescence, and burning number. A Python algorithm has been developed to find the efficiency of the maximal and co-normal products of the strongly connected product fuzzy digraph. Furthermore, we focused on identifying essential dominating nodes, a minimal arborescence, and the burning number, thereby enhancing the applications involving IoT sensors and satellite communication, and improving the overall resilience and effectiveness of IoT-based sensor systems.