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.
Procedia Computer Science
Single valued neutrosophic sets; neutrosophic matrix; score function; minimum spanning tree problem
Smarandache, Florentin; Said Broumi; Assia Bakali; Mohamed Talea; Arindam Dey; and Le Hoang Son. "Spanning Tree Problem with Neutrosophic Edge Weights." Procedia Computer Science (2018): 1-10. https://digitalrepository.unm.edu/math_fsp/416
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.