Title: Evaluation of the shortest path by using Bellman-Ford's algorithm in a fermatean neutrosophic environment

Authors: Prasanta Kumar Raut; Siva Prasad Behera

Addresses: Department of Mathematics, C.V. Raman Global University, Bhubaneswar – 752054, Odisha, India ' Department of Mathematics, C.V. Raman Global University, Bhubaneswar – 752054, Odisha, India

Abstract: The shortest path problem is an extremely important topic in graph theory with numerous real-life applications in science and technology. In this paper, we discuss an improved edition of Bellman-Ford's algorithm for evaluating the shortest path on a connected network with respect to fermatean neutrosophic numbers as the vertex weights of the given network, which is the elongation of a neutrosophic number. It is straightforward to evaluate the shortest path when the environment is certain, but in an uncertain environment, it is difficult, so here we used the fermatean neutrosophic number. Finally, we implemented our suggested methodology with a mathematical example and finally studied a comparative analysis with respect to the dynamic programming approach and with different types of existing algorithms, and discussed the advantages of our methods.

Keywords: Bellman's algorithm; directed graph network; fermatean neutrosophic numbers; FNNs; score functions; shortest path problem; SPP.

DOI: 10.1504/IJRIS.2025.146931

International Journal of Reasoning-based Intelligent Systems, 2025 Vol.17 No.2, pp.122 - 126

Received: 08 Feb 2023
Accepted: 27 Apr 2023

Published online: 27 Jun 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article