Metrics for multiset-theoretic subgraphs
Summary: 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.
- A metric for finite power multisets of positive real numbers based on minimal matching
- An algorithm for computing certain metrics in intuitionistic fuzzy graphs
- Certain Metrics in m-Polar Fuzzy Graphs
- Entropy, distance measure and similarity measure of fuzzy sets and their relations
- Fuzzy sets
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- Improvement of the distance between intuitionistic fuzzy sets and its applications
This page was built for publication: Metrics for multiset-theoretic subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631904)
