Pages that link to "Item:Q4071272"
From MaRDI portal
The following pages link to On a certain distance between isomorphism classes of graphs (Q4071272):
Displaying 26 items.
- Approximating degree sequences with regular graphic sequences (extended abstract) (Q283722) (← links)
- On the distance based graph entropies (Q668715) (← links)
- Graph distance measures based on topological indices revisited (Q669403) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (Q990638) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Greatest common subgroups with specified properties (Q1119602) (← links)
- Two metrics in a graph theory modeling of organic chemistry (Q1183341) (← links)
- Distances between graphs under edge operations (Q1356416) (← links)
- New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- On conjectures of network distance measures by using graph spectra (Q2043383) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- Model-free two-sample test for network-valued data (Q2291338) (← links)
- A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- Graphic sequences, distances and \(k\)-degree anonymity (Q2345626) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- A comparative analysis of multidimensional features of objects resembling sets of graphs (Q2474878) (← links)
- (Q3674691) (← links)
- The distance between a graph and its complement (Q3768937) (← links)
- (Q3781777) (← links)
- (Q3786497) (← links)
- Modeling Network Populations via Graph Distances (Q5881982) (← links)
