On Neutrosophic Graph

Neutrosophic Knowledge 1:9-13 (2020)
  Copy   BIBTEX

Abstract

This paper is devoted for presenting new neutrosophic similarity measures between neutrosophic graphs. We propose two 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2021-01-20

Downloads
10 (#1,221,414)

6 months
3 (#1,046,495)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

A. A. Salama
Port Said University (Alumnus)

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references