This paper is devoted for presenting new neutrosophic similarity measures between neutrosophic graphs. We proposetwo ways to determine the neutrosophic distance between neutrosophic vertex graphs. The two neutrosophic distances are based on the Haussdorff distance, and a robust modified variant of the Haussdorff distance, moreover we show that they both satisfy the metric distance measure axioms. Furthermore, a similarity measure between neutrosophic edge graphs that is based on a probabilistic variant of Haussdorff distance is introduced. The aim is to use those measures for the purpose of matching neutrosophic graphs whose structure can be described in the neutrosophic domain
In this paper, we have defined different types of similarity measures between Neutrosophic Soft (NS)...
In this paper we have obtained the similarity measures between single valued neutrosophic rough sets...
Similarity measure is an important tool in multiple criteria decision-making problems, which can be ...
This paper is devoted for presenting new neutrosophic similarity measures between neutrosophic graph...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Abstract- Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Z...
In this paper we present a new distance measure between neutrosophic refined sets on the basis of ex...
The aim of this paper is to introduce a new distance-based similarity measure for refined neutrosoph...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Hausdorff distance is one of the important distance measures to study the degree of dissimilarity be...
In this paper we proposed a new distance and several similarity measures between interval neutrosoph...
The aim of this paper is to propose a new similarity measure of singlevalued neutrosophic sets (SVNS...
In this paper, we have defined different types of similarity measures between Neutrosophic Soft (NS)...
In this paper we have obtained the similarity measures between single valued neutrosophic rough sets...
Similarity measure is an important tool in multiple criteria decision-making problems, which can be ...
This paper is devoted for presenting new neutrosophic similarity measures between neutrosophic graph...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Abstract- Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Z...
In this paper we present a new distance measure between neutrosophic refined sets on the basis of ex...
The aim of this paper is to introduce a new distance-based similarity measure for refined neutrosoph...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Smarandache (1995) defined the notion of neutrosophic sets, which is a generalization of Zadeh's fuz...
Hausdorff distance is one of the important distance measures to study the degree of dissimilarity be...
In this paper we proposed a new distance and several similarity measures between interval neutrosoph...
The aim of this paper is to propose a new similarity measure of singlevalued neutrosophic sets (SVNS...
In this paper, we have defined different types of similarity measures between Neutrosophic Soft (NS)...
In this paper we have obtained the similarity measures between single valued neutrosophic rough sets...
Similarity measure is an important tool in multiple criteria decision-making problems, which can be ...