Metrics for Single-Edged Graphs over a Fixed Set of Vertices

Abstract

Graphs have powerful representations of all kinds of theoretical or experimental mathematical objects. A technique to measure the distance between graphs has become an important issue. In this article, we show how to define distance functions measuring the distance between graphs with directed edges over a fixed set of named and unnamed vertices, respectively. Furthermore, we show how to implement these distance functions via computational matrix operations.