Neutrosophic Pythagorean Fuzzy Shortest Path in a Network

M. Asim Basha¹, M. Mohammed Jabarulla², Broumi said^3,4

^1,2 Department of Mathematics Jamal Mohamed College (Autonomous) Tiruchirappalli – 620020, Tamil Nadu, India (Affiliated to Bharathidasan University)

³ Laboratory of Information Processing, Faculty of Science Ben M’Sik, University of Hassan II, Casablanca, Morocco

⁴ Regional Center for the Professions of Education and Training(C.R.M.E.F), Casablanca-settat, Morocco.      

Emails: asimbasha36@gmail.com; m.md.jabarulla@gmail.com; broumisaid78@gmail.com

Abstract

We began a novel technique to dealing with the Neutrosophic Pythagorean shortest route problem in a network in this paper by representing each edge weight as a triangular fuzzy Pythagorean number with dependent Neutrosophic components and Pythagorean fuzzy graph condition. . The main purpose of this article is to show how to use Neutrosophic Pythagorean fuzzy graphs. As a result, we created the proposed method, which also delivers the shortest path length from the source node (SN) to the destination node by using a ranking function for the Neutrosophic Pythagorean fuzzy Triangular number. Finally, an illustrative instance is supplied for validation.

Keywords: Neutrosophic Pythagorean fuzzy Triangular number (NPFTN); Score function (SF); Accuracy function (AF); Neutrosophic Pythagorean shortest path problem (NPSPP).