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

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.

AtıfScopus16·OpenAlex11

İncele