Properties of graph distance measures by means of discrete inequalities

DOI10.1016/j.apm.2018.01.027zbMath1480.05041OpenAlexW2793601924WikidataQ130147377 ScholiaQ130147377MaRDI QIDQ2295900

Shailesh Tripathi, Aliyu Musa, Frank Emmert-Streib, Yongtang Shi, Abbe Mowshowitz, Matthias Dehmer, Zeng-Qiang 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

inequalitiesnetworksgraphssimilarity measuresdistance measures

Mathematics Subject Classification ID

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

Related Items (1)

On efficient network similarity measures

Uses Software

• nauty
• QuACN

Cites Work

• Optimised crossover genetic algorithm for capacitated vehicle routing problem
• Fifty years of graph matching, network alignment and network comparison
• Graph Energy
• Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation
• On a certain distance between isomorphism classes of graphs
• On Some Applications of Information Indices in Chemical Graph Theory
• A Generalization of a Theorem of Bôcher
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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