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: | Ray-Ming Chen |
---|---|
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!
|
Similar Items
-
Group-Valued Multisets
by: Andrei Alexandru, et al.
Published: (2025-01-01) -
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
by: Yunhao Sun, et al.
Published: (2020-01-01) -
On forbidden subgraphs of main supergraphs of groups
by: Xiaoyan Xu, et al.
Published: (2024-08-01) -
On the frequency of multisets without some components
by: Eugenijus Manstavičius
Published: (2000-12-01) -
On the Distributions of Subgraph Centralities in Complex Networks
by: Faxu Li, et al.
Published: (2013-01-01)