Metrics for Multi-Set-Theoretic Graphs over Fixed Set of Vertices

Abstract

In this article, we show how to define distance functions for multi-edged graphs, either with vertices being labelled or unlabelled. These metrics are constructed mainly based on the minimal matching for multi-sets. In the end, we implement such metrics based on adjacent matrices. These metrics provide some important applications in the real world.