Shortest path problem under interval valued neutrosophic setting
Küçük Resim Yok
Tarih
2019
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
World Academy of Research in Science and Engineering
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
This paper provides a research of the shortest neutrosophic path with interval valued neutrosophic numbers on a network. The suggested algorithm also provides the shortest path length utilizing ranking function from the source node to the destination node. Each of the arc lengths is attributed to an interval valued neutrosophic number. Lastly, we provide a numerical example to illustrate the suggested approach. © 2019, World Academy of Research in Science and Engineering. All rights reserved.
Açıklama
Anahtar Kelimeler
Interval Valued Neutrosophic Graph, Score Function, Shortest Path Problem, Interval Valued Neutrosophic Graph, Score Function, Shortest Path Problem
Kaynak
International Journal of Advanced Trends in Computer Science and Engineering
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
8
Sayı
1
