Minimum Tree t-Spanners on Fuzzy Ratio Labelled General Graphs - NP Complete

Abstract

Tree t-spanners are trees that span a graph that involve distances and are useful in

designing telecommunication, electrical networks, civil network planning, and more. Extending the

idea of tree t–spanner in fuzzy graphs is the concept of this paper. The study focuses on tree t

spanners of ratio-labelled fuzzy graphs using the Breadth-First Search (BFS) algorithm, which is

crucial for optimizing communication and routing efficiency in networks