Journal article Open Access

Spanning Tree Problem with Neutrosophic Edge Weights

Said Broumi; Assia Bakali; Mohamed Talea; Florentin Smarandache; Arindam Dey; Le Hoang Son

Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided.

Files (1.6 MB)
Name Size
SpanningTreeProblem.pdf
md5:abb48b12c3006cf9b19327b750f277e9
1.6 MB Download
6
8
views
downloads
All versions This version
Views 66
Downloads 88
Data volume 13.1 MB13.1 MB
Unique views 66
Unique downloads 77

Share

Cite as