No Detail Found!

Computing Shortest Path in a Single Valued Neutrosophic Hesitant Fuzzy Network

Author(s)
M. Saad Department of Mathematics, International Islamic University,Islamabad,Pakistan
T. Mahmood Department of Mathematics, International Islamic University,Islamabad,Pakistan
Kifayat Ullah Department of Mathematics, International Islamic University,Islamabad,Pakistan
N. Jan Department of Mathematics, International Islamic University,Islamabad,Pakistan
Abstract
In engineering, computer sciences and many other applied sciences, finding shortest path in a network is one of the famous problems. The aim of this manuscript is to develop a novel algorithm for finding shortest path in a network where nodes and edges have some uncertainty. Firstly, the concept of singlevalued neutrosophic hesitant fuzzy graph (SVNHFG) has been introduced with some related graph theoretical results such that complement, subgraph, degree and path etc. Some examples are provided to understand the defined concepts. Then, the new algorithm for solving shortest path problems (SPPs) has been introduced followed by a flowchart for a stepwise description. A numerical example is provided in the environment of SVNHFGs to demonstrate the proposed algorithm. The advantages of proposed method over the existing techniques are also discussed.
Publication Details
Page(s) 123-130
DOI DOI not available
Published Journal: Nucleus, Volume: 56, Issue: 3, Year: 2019

Request the full text from PASTIC

Keywords
Networking, Single-valued neutrosophic graphs, Shortest path problem, Single-valued neutrosophic hesitant fuzzy graphs
0

Citations

0

Downloads

68

Views