Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment

In this paper, an algorithm for searching the minimum spanning tree
(MST) in a network having trapezoidal fuzzy neutrosophic edge weight is
presented. The network is an undirected neutrosophic weighted connected graph (UNWCG). The proposed algorithm is based on matrix approach to design the MST of UNWCG. A numerical example is provided to check the validity of the proposed algorithm. Next, a comparison example is made with Mullai’s algorithm in neutrosophic graphs.