Calculation of shortest path on Fermatean Neutrosophic Networks

Abstract

The shortest path (SP) problem (SPP) has several applications in graph theory. It can be used
to calculate the distance between the provided initial and final vertex in a network. In this
paper, we employed the Fermatean neutrosophic number as the appropriate edge weight of
the network to estimate the SP connecting the start and end vertex. This technique is highly
useful in establishing the shortest path for the decision-maker under uncertainty. We also
investigated its effectiveness in comparison to several existing methods. Finally, a few
numerical tests were performed to demonstrate the validity and stability of this new
technique, as well as to compare different types of shortest paths with different networks