[HTML][HTML] Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
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 …
deeply to workout the shortest path problem. In this paper, we compared the shortest path …
Interval valued neutrosophic graphs
The notion of interval valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic
fuzzy sets, interval valued fuzzy sets, interval valued intuitionstic fuzzy sets and single …
fuzzy sets, interval valued fuzzy sets, interval valued intuitionstic fuzzy sets and single …
Single and multi-valued neutrosophic hypersoft set and tangent similarity measure of single valued neutrosophic hypersoft sets
As the analysis of classical sets, fuzzy set [1] and intuitionistic fuzzy set [2], the neutrosophic
set was introduced by Smarandache [3, 4] to capture the insufficient, indicate, uncertain and …
set was introduced by Smarandache [3, 4] to capture the insufficient, indicate, uncertain and …
Single valued neutrosophic graphs: degree, order and size
The single valued neutrosophic graph is a new version of graph theory presented recently
as a generalization of fuzzy graph and intuitionistic fuzzy graph. The single valued …
as a generalization of fuzzy graph and intuitionistic fuzzy graph. The single valued …
A projection-based TODIM method under multi-valued neutrosophic environments and its application in personnel selection
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 …
(MVNSs) can denote the fuzziness and hesitancy in the processes of the personnel …
Applying Dijkstra algorithm for solving neutrosophic shortest path problem
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 …
literature, many algorithms have been developed to provide a solution for shortest path …
Algorithms for neutrosophic soft decision making based on EDAS, new similarity measure and level soft set
X Peng, C Liu - Journal of Intelligent & Fuzzy Systems, 2017 - content.iospress.com
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 …
we initiate a new axiomatic definition of single-valued neutrosophic similarity measure …
Interval-valued fermatean neutrosophic graphs
S Broumi, R Sundareswaran… - Collected …, 2022 - books.google.com
In this work, we define Interval-valued Fermatean neutrosophic graphs (IVFNS) and present
some operations on Interval-valued Fermatean neutrosophic graphs. Further, we introduce …
some operations on Interval-valued Fermatean neutrosophic graphs. Further, we introduce …
Similarity measures of bipolar neutrosophic sets and their application to multiple criteria decision making
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 …
Dice similarity measure, weighted Dice similarity measure, Hybrid vector similarity measure …
[图书][B] Neutrosophic Dominating
H Garrett - 2023 - books.google.com
In this book, some notions are introduced about “Neutrosophic Dominating”. Six chapters
are devised as “Neutrosophic Dominating”,“Neutrosophic Duality”,“Neutrosophic …
are devised as “Neutrosophic Dominating”,“Neutrosophic Duality”,“Neutrosophic …