Properties of graph distance measures by means of discrete inequalities

DOI10.1016/J.APM.2018.01.027MaRDI QIDQ2295900zbMATH OpenOpenAlexWikidataFDO

Authors Matthias Dehmer, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi, Aliyu Musa, Abbe Mowshowitz, Zengqiang Chen

Publication date 17 February 2020

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2018.01.027

zbMATH Keywords

distance measuresgraphsinequalitiesnetworkssimilarity measures

Mathematics Subject Classification ID

Distance in graphs (05C12) Deterministic network models in operations research (90B10)

Recommendations

• Inequalities between degree- and distance-based graph invariants
• Further properties on the degree distance of graphs
• Some properties of a dissimilarity measure for labeled graphs
• Inequalities between distance-based graph polynomials
• Some inequalities in distance-regular graphs
• On distance-based graph invariants
• On mean distance in certain classes of graphs
• Distances between graphs under edge operations
• Some extremal properties of the degree distance of a graph
• Some extremal properties of the degree distance of a graph

Cites work

• A Generalization of a Theorem of Bôcher
• A new method of measuring similarity for a special class of directed graphs
• Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation
• Fifty years of graph matching, network alignment and network comparison
• Graph energy
• scientific article; zbMATH DE number 1618184 (Why is no real title available?)
• scientific article; zbMATH DE number 3781232 (Why is no real title available?)
• scientific article; zbMATH DE number 3781233 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• scientific article; zbMATH DE number 3251135 (Why is no real title available?)
• On a certain distance between isomorphism classes of graphs
• On Some Applications of Information Indices in Chemical Graph Theory
• Optimised crossover genetic algorithm for capacitated vehicle routing problem
• Some observations on comparing Zagreb indices

Cited in

(11)

• New inequalities for network distance measures by using graph spectra
• A proof of the triangle inequality for the Tanimoto distance
• On efficient network similarity measures
• A comparative analysis of new graph distance measures and graph edit distance
• Algebraic distance on graphs
• A linear-time algorithm and analysis of graph relative Hausdorff distance
• Probabilistic inequalities for evaluating structural network measures
• A measure-theoretic representation of graphs
• Efficient graph similarity assessment method based on vectors of topological indices
• A distribution-based framework for network similarity assessment
• Structure-based graph distance measures of high degree of precision

Describes a project that uses

Uses Software

• nauty
• QuACN

This page was built for publication: Properties of graph distance measures by means of discrete inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295900)