Journal article Open Access

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs

Arindam Dey; Said Broumi; Assia Bakali; Mohamed Talea; Florentin Smarandache

In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length.We define this type of MST as neutrosophic minimum spanning tree (NMST). We describe the utility of neutrosophic numbers as arc lengths and its application in different real world MST problems.

Files (649.5 kB)
Name Size
ANewAlgorithmForFinding.pdf
md5:abb309ccc9dfaebb846dcb27bd717f09
649.5 kB Download
5
9
views
downloads
All versions This version
Views 55
Downloads 99
Data volume 5.8 MB5.8 MB
Unique views 55
Unique downloads 88

Share

Cite as