Affiliation:
1. School of Mathematics and Statistics, Baise University, 21, Zhongshan No. 2 Road, Guangxi Province, China
Abstract
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.
Funder
Natural Science Foundation of Fujian Province
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Economic Categorizing Based on DFT-induced Supervised Learning;Computational Economics;2020-11-30
2. A Novel Metric for Incomplete Information Based on Equivalence Classes;2020 3rd International Conference on Sensors, Signal and Image Processing;2020-10-09
3. A Unified Proof for Finding a Minimal Spanning Tree;Proceedings of the 2020 3rd International Conference on Mathematics and Statistics;2020-06-21
4. A Linear Metric for Multivariate Discrete Finite Data Based on Data-derived Analytical Meshes;Proceedings of the 2020 3rd International Conference on Mathematics and Statistics;2020-06-21
5. A Decision Procedure for Countable Metrics;Proceedings of 2020 the 6th International Conference on Computing and Data Engineering;2020-01-04