Bellman Ford Algorithm for the Shortest Path Problem in a Neutrosophic Pythagorean Fuzzy Network

Authors

  • Asim Basha M Department of Humanities & Science (Mathematics), Arunai Engineering College (Autonomous), Tiruvannamalai, Tamilnadu, India Author https://orcid.org/0009-0000-7263-553X
  • Mohammed Jabarulla M PG & Research Department of Mathematics, Jamal Mohamed College (Autonomous), Tiruchirappalli, Tamilnadu, India Author
  • Broumi Said STIE Team, Regional Center for the Professions of Education and Training (C.R.M.E.F), Casablanca-Settat, Morocco Author

DOI:

https://doi.org/10.64060/ANMI1V1i4

Keywords:

Neutrosophic Pythagorean Fuzzy Graph (NPFG), Neutrosophic Pythagorean Fuzzy Triangular Fuzzy Numbers (NPTFNs), Neutrosophic Pythagorean Triangular Fuzzy Shortest Path Problem (NPTFSPP), Network Optimization

Abstract

The study describes a method for discovering the shortest path in networks that employs Neutrosophic Pythagorean Fuzzy Graph and Triangular Fuzzy Numbers (TFN). This method uses neutrosophic logic and Pythagorean fuzzy sets for handling ambiguous and imprecise data. The Neutrosophic Pythagorean Fuzzy Shortest Path (NPFSP) algorithm calculates the shortest path while accounting for membership functions for truth, indeterminacy, and falsity. The technique provides improved flexibility and accuracy when dealing with uncertainty.

145

Downloads

Published

2026-04-15

Issue

Vol. 1 No. 1 (2026)

Section

Articles

License

Copyright (c) 2026 Asim Basha M , Mohammed Jabarulla M , Broumi Said (Author)

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Bellman Ford Algorithm for the Shortest Path Problem in a Neutrosophic Pythagorean Fuzzy Network. (2026). Advances in Neutrosophic Mathematics and Informatics, 1(1), 24-30. https://doi.org/10.64060/ANMI1V1i4

Share