Journal article Open Access

SHORTEST PATH PROBLEM UNDER INTERVAL VALUED NEUTROSOPHIC SETTING

S. Broumi; A. Bakali; M. Talea; F. Smarandache; K. Kishore; R. Sahin

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 (368.5 kB)
Name Size
ShortestPathProblemUnder.pdf
md5:7f012fcbe65739c66807e8b918ad6d2e
368.5 kB Download
5
6
views
downloads
All versions This version
Views 55
Downloads 66
Data volume 2.2 MB2.2 MB
Unique views 55
Unique downloads 55

Share

Cite as