In the last decade, concealed by uncertain atmosphere, many algorithms have been studied
deeply to workout the shortest path problem. In this paper, we compared the shortest path …

The most widely used technique for solving and optimizing a real-life problem is linear
programming (LP), due to its simplicity and efficiency. However, in order to handle the …

Neutrosophic set, initiated by Smarandache, is a novel tool to deal with vagueness
considering the truth-membership T, indeterminacy-membership I and falsity-membership F …

The selection of shortest path problem is one the classic problems in graph theory. In
literature, many algorithms have been developed to provide a solution for shortest path …

The personnel selection is a vital activity for companies, and multi-valued neutrosophic sets
(MVNSs) can denote the fuzziness and hesitancy in the processes of the personnel …

This paper presents three novel single-valued neutrosophic soft set (SVNSS) methods. First,
we initiate a new axiomatic definition of single-valued neutrosophic similarity measure …

In this paper, we introduced some similarity measures for bipolar neutrosophic sets such as;
Dice similarity measure, weighted Dice similarity measure, Hybrid vector similarity measure …

Yager et. al. defined a q-rung orthopair fuzzy sets as a new general class of Pythagorean
fuzzy set in which the sum of the qth power of the support for and support against is bonded …

In this work, we define Interval-valued Fermatean neutrosophic graphs (IVFNS) and present
some operations on Interval-valued Fermatean neutrosophic graphs. Further, we introduce …

In this work, a neutrosophic network method is proposed for finding the shortest path length
with single valued trapezoidal neutrosophic number. The proposed algorithm gives the …