Metrics for Single-Edged Graphs over a Fixed Set of Vertices
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-10-01
|
| Series: | Mathematical and Computational Applications |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2297-8747/23/4/66 |
| _version_ | 1819080115183681536 |
|---|---|
| author | Ray-Ming Chen |
| author_facet | Ray-Ming Chen |
| author_sort | Ray-Ming Chen |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-21T19:39:45Z |
| format | Article |
| id | doaj.art-606a24a468a442d986a073f0fb804952 |
| institution | Directory Open Access Journal |
| issn | 2297-8747 |
| language | English |
| last_indexed | 2024-12-21T19:39:45Z |
| publishDate | 2018-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematical and Computational Applications |
| spelling | doaj.art-606a24a468a442d986a073f0fb8049522022-12-21T18:52:30ZengMDPI AGMathematical and Computational Applications2297-87472018-10-012346610.3390/mca23040066mca23040066Metrics for Single-Edged Graphs over a Fixed Set of VerticesRay-Ming Chen0School of Mathematics and Statistics, Baise University, Baise 533000, ChinaGraphs 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.https://www.mdpi.com/2297-8747/23/4/66graphsmetricsverticesdirected edges |
| spellingShingle | Ray-Ming Chen Metrics for Single-Edged Graphs over a Fixed Set of Vertices Mathematical and Computational Applications graphs metrics vertices directed edges |
| title | Metrics for Single-Edged Graphs over a Fixed Set of Vertices |
| title_full | Metrics for Single-Edged Graphs over a Fixed Set of Vertices |
| title_fullStr | Metrics for Single-Edged Graphs over a Fixed Set of Vertices |
| title_full_unstemmed | Metrics for Single-Edged Graphs over a Fixed Set of Vertices |
| title_short | Metrics for Single-Edged Graphs over a Fixed Set of Vertices |
| title_sort | metrics for single edged graphs over a fixed set of vertices |
| topic | graphs metrics vertices directed edges |
| url | https://www.mdpi.com/2297-8747/23/4/66 |
| work_keys_str_mv | AT raymingchen metricsforsingleedgedgraphsoverafixedsetofvertices |