Shortest Path Problem in Network with Quadripartitioned Neutrosophic Arc Length

Broumi Said (STIE team, Regional Center for the Professions of Education and Training(C.R.M.E.F) & Laboratory of Information Processing, Faculty of Science Ben M’Sik, University of Hassan II)
Yuhao Su (Central Plains Agricultural Civilization Research Center)
M. Parimala (Bannari Amman Institute of Technology)
Yekini Shehu (Zhejiang Normal University)

Journal of Analytical Uncertainty
Vol. 1 No. 1 (2025): JAU: December 2025

Many extensions and generalizations of neutrosophic sets have been introduced and studied in the literature. Quadripartitioned single valued neutrosophic set becomes an important tool in solving various types of decision making problems, medical diagnosis problems, clustering,... etc. The neutrosophic graph has still been a powerful tool for modeling and designing indeterminate networks. Quadripartitioned single valued neutrosophic graph is a generalization of single valued neutrosophic graph. In this chaptre, we formulate the shortest path (SP) problem in Quadripartitioned single valued neutrosophic environment. Here, the costs related to arcs are taken in the form of Quadripartitioned single valued neutrosophic numbers (QSVNNs). A numerical example also included illustrating our proposed method for finding the neutrosophic shortest path.