Combinatorics and Graph Theory

   

A Neutrosophic Graph Similarity Measures

Authors: Shimaa Fathi, Hewayda Elghawalby, A.a. Salama

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.

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2016-11-23 16:16:31

Unique-IP document downloads: 18 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus