Arindam Dey

Liangsong Huang 

Yu Hu

Yuxia Li

P. K. Kishore Kumar

Dipak Koley 

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results.

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

Said Broumi

Ranjan Kumar

Sripati Jha

S A Edaltpanah

Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP). A simple algorithm is also introduced to solve the NSSPP. The proposed algorithm finds the neutrosophic shortest path (NSSP) and its corresponding neutrosophic shortest path length (NSSPL) between source node and destination node.

Neutrosophic Shortest Path Problem

S. Broumi

S A Edalatpanah

Ramayan Singh

Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely different applications in real world eventualities. However, the uncertainty related to the inconsistent information and indeterminate information isn't properly expressed by fuzzy set. The neutrosophic set deals these forms of uncertainty. This paper presents a model for shortest path problem with various arrangements of integer-valued trapezoidal neutrosophic (INVTpNS) and integer-valued triangular neutrosophic (INVTrNS). We characterized this issue as Neutrosophic Shortest way problem (NSSPP). The established linear programming (LP) model solves the classical SPP that consists of crisp parameters. To the simplest of our data, there's no multi objective applied mathematics approach in literature for finding the Neutrosophic shortest path problem (NSSPP).

A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems

Ling Xin

Bin Zhou

Haitao Lin

The computing with Words (CW) is a well known soft computing method to find the solutions of many decision making problems in real life scenarios which consists of selective information used in natural language.

A Novel Approach Of Computing With Words By Using Neutrosophic Information

Arindam Dey

About

Books

Join the club