Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Journal of Analytical Uncertainty
Yekini Shehu
Zhejiang Normal University
Computer Science & IT Engineering Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Shortest Path Problem in Network with Quadripartitioned Neutrosophic Arc Length Broumi Said; Yuhao Su; M. Parimala; Yekini Shehu
Journal of Analytical Uncertainty Vol. 1 No. 1 (2025): JAU: December 2025
Publisher : Winaya Inspirasi Nusantara Foundation

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63924/jau.v1i1.262

Abstract

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.
Co-Authors Broumi Said M. Parimala Yuhao Su