New inequalities for network distance measures by using graph spectra

DOI10.1016/j.dam.2016.02.024zbMath1401.05275OpenAlexW2346372059MaRDI QIDQ1630771

Yongtang Shi, Stefan Pickl, Guihai Yu, Matthias Dehmer

Publication date: 10 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.024

zbMATH Keywords

networksgraph theoryanalytics

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Related Items (2)

Network similarity measure and Ediz eccentric connectivity index ⋮ On conjectures of network distance measures by using graph spectra

Cites Work

• Evolution of cooperation in the traveler's dilemma game on two coupled lattices
• Extremality of degree-based graph entropies
• Graph distance measures based on topological indices revisited
• Spectral methods for graph clustering - a survey
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Inertia and biclique decompositions of joins of graphs
• Which graphs are determined by their spectrum?
• Note on two generalizations of the Randić index
• LP formulations of the shortest path tree problem
• Bicyclic graphs with small positive index of inertia
• Fifty years of graph matching, network alignment and network comparison
• Static search games played over graphs and general metric spaces
• A note on distance-based graph entropies
• The inertia of weighted unicyclic graphs
• On some applications of the selective graph coloring problem
• Continuous quadratic programming formulations of optimization problems on graphs
• Graph Energy
• On a conjecture about tricyclic graphs with maximal energy
• Eigenvalue bounds for the signless laplacian
• On the measurable solution of a functional equation arising in information theory
• On a certain distance between isomorphism classes of graphs
• More on the minimum skew-rank of graphs
• The signless Laplacian spectral radius of bounded degree graphs on surfaces
• The Maximal Matching Energy of Tricyclic Graphs
• The spectral radius of edge chromatic critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New inequalities for network distance measures by using graph spectra