Journal article Open Access

Shortest Path Problem Under Interval Valued Neutrosophic Setting

Said Broumi; Assia Bakali; Mohamed Talea; Florentin Smarandache; K. P. Krishnan Kishore; Rıdvan Şahin

This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here
each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.

Files (151.6 kB)
Name Size
ShortestPathProblemUnderInterval.pdf
md5:4f58ed3810ef6687bd504fe1dc0e4d86
151.6 kB Download
5
6
views
downloads
All versions This version
Views 55
Downloads 66
Data volume 909.4 kB909.4 kB
Unique views 55
Unique downloads 55

Share

Cite as