On a certain distance between isomorphism classes of graphs
From MaRDI portal
Publication:4071272
DOI10.21136/cpm.1975.117890zbMath0312.05121OpenAlexW2734353507MaRDI QIDQ4071272
Publication date: 1975
Full work available at URL: https://eudml.org/doc/21256
Related Items (26)
Modeling Network Populations via Graph Distances ⋮ Approximating degree sequences with regular graphic sequences (extended abstract) ⋮ Comparing large graphs efficiently by margins of feature vectors ⋮ New inequalities for network distance measures by using graph spectra ⋮ A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees ⋮ Distances between graphs under edge operations ⋮ A similarity measure for graphs with low computational complexity ⋮ Greatest common subgroups with specified properties ⋮ Two metrics in a graph theory modeling of organic chemistry ⋮ On the distance based graph entropies ⋮ Graph distance measures based on topological indices revisited ⋮ Unnamed Item ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs ⋮ Structural similarity of directed universal hierarchical graphs: a low computational complexity approach ⋮ On efficient network similarity measures ⋮ Model-free two-sample test for network-valued data ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ On conjectures of network distance measures by using graph spectra ⋮ Properties of graph distance measures by means of discrete inequalities ⋮ Quantitative graph theory: a new branch of graph theory and network science ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph isomorphism problem ⋮ Graphic sequences, distances and \(k\)-degree anonymity ⋮ The distance between a graph and its complement
This page was built for publication: On a certain distance between isomorphism classes of graphs
