Metrics for Multiset-Theoretic Subgraphs
We show how to define a plethora of metrics for graphs—either full graphs or subgraphs. The method mainly utilizes the minimal matching between any two multisets of positive real numbers by comparing the multiple edges with respect to their corresponding vertices. In the end of this article, we also...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Journal of Function Spaces |
| Online Access: | http://dx.doi.org/10.1155/2019/7630242 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832553542570737664 |
|---|---|
| author | Ray-Ming Chen |
| author_facet | Ray-Ming Chen |
| author_sort | Ray-Ming Chen |
| collection | DOAJ |
| description | We show how to define a plethora of metrics for graphs—either full graphs or subgraphs. The method mainly utilizes the minimal matching between any two multisets of positive real numbers by comparing the multiple edges with respect to their corresponding vertices. In the end of this article, we also demonstrate how to implement these defined metrics with the help of adjacency matrices. These metrics are easy to be manipulated in real applications and could be amended according to different situations. By our metrics, one should be able to compare the distances between graphs, trees, and networks, in particular those with fuzzy properties. |
| format | Article |
| id | doaj-art-5479614decb54a4cb43ad60ee46ca9ea |
| institution | Kabale University |
| issn | 2314-8896 2314-8888 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Function Spaces |
| spelling | doaj-art-5479614decb54a4cb43ad60ee46ca9ea2025-02-03T05:53:43ZengWileyJournal of Function Spaces2314-88962314-88882019-01-01201910.1155/2019/76302427630242Metrics for Multiset-Theoretic SubgraphsRay-Ming Chen0School of Mathematics and Statistics, Baise University, 21, Zhongshan No. 2 Road, Guangxi Province, ChinaWe show how to define a plethora of metrics for graphs—either full graphs or subgraphs. The method mainly utilizes the minimal matching between any two multisets of positive real numbers by comparing the multiple edges with respect to their corresponding vertices. In the end of this article, we also demonstrate how to implement these defined metrics with the help of adjacency matrices. These metrics are easy to be manipulated in real applications and could be amended according to different situations. By our metrics, one should be able to compare the distances between graphs, trees, and networks, in particular those with fuzzy properties.http://dx.doi.org/10.1155/2019/7630242 |
| spellingShingle | Ray-Ming Chen Metrics for Multiset-Theoretic Subgraphs Journal of Function Spaces |
| title | Metrics for Multiset-Theoretic Subgraphs |
| title_full | Metrics for Multiset-Theoretic Subgraphs |
| title_fullStr | Metrics for Multiset-Theoretic Subgraphs |
| title_full_unstemmed | Metrics for Multiset-Theoretic Subgraphs |
| title_short | Metrics for Multiset-Theoretic Subgraphs |
| title_sort | metrics for multiset theoretic subgraphs |
| url | http://dx.doi.org/10.1155/2019/7630242 |
| work_keys_str_mv | AT raymingchen metricsformultisettheoreticsubgraphs |