Graph similarity and distance in graphs
From MaRDI portal
Publication:1381547
DOI10.1007/s000100050025zbMath0889.05043OpenAlexW1997780247MaRDI QIDQ1381547
Gary Chartrand, Michelle Schultz, Grzegorz M. Kubicki
Publication date: 29 May 1998
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000100050025
Related Items (8)
Some measures of dissimilarity in intuitionistic fuzzy structures ⋮ Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ On distance between graphs ⋮ Similarity in languages and programs ⋮ Filtered simplicial homology, graph dissimilarity and überhomology ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ Dissimilarity measures between fuzzy sets or fuzzy structures. ⋮ Partial cubes are distance graphs
This page was built for publication: Graph similarity and distance in graphs