Calculation of Fuzzy shortest path problem using Multi-valued Neutrosophic number under fuzzy environment

Abstract

The most well-known subject in graph theory is the shortest path problem (SPP),
which has real-world applications in several different fields of study, including
transportation, emergency services, network communications, fire station services, etc. The
arc weights of the applicable SP problems are typically represented by fuzzy numbers in
real-world applications. In this paper, we discussed the process of finding the shortest
distance in a connected graph network in which the arc weights are multi-valued
neutrosophic numbers (MNNs). Moreover, here we compare our method with some of the
existing results and illustrate one implementation of our method with the help of one
numerical example