Measuring Closeness of Graphs—The Hausdorff Distance

We introduce an apparatus to measure closeness or relationship of two given objects. This is a topology-based apparatus that uses graph representations of the compared objects. In more detail, we obtain a metric on the class of all pairwise non-isomorphic connected simple graphs to measure closeness...

Full description

Saved in:
Bibliographic Details
Published in:Bulletin of the Malaysian Mathematical Sciences Society 2017, Vol.40 (1), p.75-95
Main Authors: Banič, Iztok, Taranenko, Andrej
Format: Article
Language:English
Subjects:
Amalgams
Applications of Mathematics
Graph representations
Graphical representations
Graphs
Hyperspaces
Mathematics
Mathematics and Statistics
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce an apparatus to measure closeness or relationship of two given objects. This is a topology-based apparatus that uses graph representations of the compared objects. In more detail, we obtain a metric on the class of all pairwise non-isomorphic connected simple graphs to measure closeness of two such graphs. To obtain such a measure, we use the theory of hyperspaces from topology to introduce the notion of the Hausdorff graph 2 G of any graph G . Then, using this new concept of Hausdorff graphs combined with the notion of graph amalgams, we present the Hausdorff distance, which proves to be useful when examining the closeness of any two connected simple graphs. We also present many possible applications of these concepts in various areas.
ISSN:0126-6705
2180-4206
DOI:10.1007/s40840-015-0259-1