Study On Single Valued Neutrosophic Graph With Application In Shortest Path Problem

This study introduces some new concepts of single-valued neutrosophic graph (SVNG). The authors have discussed the definition of regular SVNG, complete SVNG and strong SVNG. The shortest path problem is a well-known combinatorial optimisation problem in the field of graph theory due to its various applications. Uncertainty is present in almost every application of shortest path problem which makes it very hard to decide the edge weight properly.

A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs.

This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.

The concepts of graph theory are applied in many areas of computer science including image segmentation, data mining, clustering, image capturing and networking. Fuzzy graph theory is successfully used in many problems, to handle the uncertainty that occurs in graph theory. A single valued neutrosophic graph (SVNG) is an instance of a neutrosophic graph and a generalization of the fuzzy graph, intuitionistic fuzzy graph, and interval-valued intuitionistic fuzzy graph. In this paper, the basic operations on SVNGs such as direct product, Cartesian product, semi-strong product, strong product, lexicographic product, union, ring sum and join are defined. Moreover, the degree of a vertex in SVNGs formed by these operations in terms of the degree of vertices in the given SVNGs in some particular cases are determined. Finally, an application of single valued neutrosophic digraph (SVNDG) in traval time is provided.

Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc. are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function. A numerical example is used to illustrate the proposed approach.

The shortest path problem (SPP) is considerably important in several fields. After typhoons, the resulting damage leads to uncertainty regarding the path weight that can be expressed accurately. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership degrees of the elements. In an uncertain environment, neutrosophic numbers can express the edge distance more effectively.

The concept of this research is introduced to interval-valued trapezoidal neutrosophic fuzzy graph which is combined to trapezoidal fuzzy numbers and interval-valued neutrosophic fuzzy graph. In this analysis, proposed algorithm finds source node and destination node because of the shortest path problem. In this research, we apply trapezoidal number with interval-valued neutrosophic fuzzy graph and finding their score function. Eventually an illustrative example to explain, to easy way of shortest path fuzzy graph.

An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.