TY - JOUR
AU - Saad, M.
AU - Mahmood, T.
AU - Ullah, Kifayat
AU - Jan, N.
PY - 2020/03/20
Y2 - 2024/05/27
TI - Computing Shortest Path in a Single Valued Neutrosophic Hesitant Fuzzy Network
JF - The Nucleus
JA - The Nucleus
VL - 56
IS - 3
SE - Articles
DO -
UR - http://thenucleuspak.org.pk/index.php/Nucleus/article/view/627
SP - 123-130
AB - <p>In engineering, computer sciences and many other applied sciences, finding shortest path in a network<br />is one of the famous problems. The aim of this manuscript is to develop a novel algorithm for finding<br />shortest path in a network where nodes and edges have some uncertainty. Firstly, the concept of singlevalued<br />neutrosophic hesitant fuzzy graph (SVNHFG) has been introduced with some related graph<br />theoretic results. Some examples are provided to understand the defined concepts. Then, the new<br />algorithm for solving shortest path problems (SPPs) has been introduced followed by a flowchart for a<br />stepwise description. A numerical example is provided in the environment of SVNHFGs to demonstrate<br />the proposed algorithm. The advantages of proposed method over the existing techniques are also<br />studied.</p>
ER -