Journal article Open Access

Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment

Said Broumi; Assia Bakali; Mohamed Talea; Florentin Smarandache; Vakkas Uluçay

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.

Files (791.2 kB)
Name Size
MinimumSpanningTreeInTrapezoidal.pdf
md5:e5eb0c16cfba1a17743c2f3bc24cdf09
791.2 kB Download
7
9
views
downloads
All versions This version
Views 77
Downloads 99
Data volume 7.1 MB7.1 MB
Unique views 77
Unique downloads 88

Share

Cite as