Graph distance measures based on topological indices revisited
From MaRDI portal
Publication:669403
DOI10.1016/j.amc.2015.05.072zbMath1410.05041OpenAlexW871532349MaRDI QIDQ669403
Yongtang Shi, Frank Emmert-Streib, Matthias Dehmer
Publication date: 15 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.05.072
Related Items (14)
New inequalities for network distance measures by using graph spectra ⋮ Novel results on partial Hosoya polynomials: an application in chemistry ⋮ Connective Steiner 3-eccentricity index and network similarity measure ⋮ On the zeros of the partial Hosoya polynomial of graphs ⋮ On the ordering of distance-based invariants of graphs ⋮ On the relationship between PageRank and automorphisms of a graph ⋮ Network similarity measure and Ediz eccentric connectivity index ⋮ Digraphs with large maximum Wiener index ⋮ Counterexamples to conjectures on graph distance measures based on topological indexes ⋮ Relations between distance-based and degree-based topological indices ⋮ Hosoya entropy of fullerene graphs ⋮ Comparing large-scale graphs based on quantum probability theory ⋮ A note on distance-based entropy of dendrimers ⋮ Graph operations based on using distance-based graph entropies
Cites Work
- 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
- 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
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- On rainbow domination numbers of graphs
- Probabilistic inequalities for evaluating structural network measures
- Unicyclic graphs with large energy
- Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- A survey of graph edit distance
- The \((n,n)\)-graphs with the first three extremal Wiener indices
- The maximum edit distance from hereditary graph properties
- Applications of a theorem by Ky Fan in the theory of graph energy
- Edit distance and its computation
- Chemical trees minimizing energy and Hosoya index
- Bicyclic graphs with small positive index of inertia
- Fifty years of graph matching, network alignment and network comparison
- The inertia of weighted unicyclic graphs
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- EPIDEMICS OF SIRS MODEL WITH NONUNIFORM TRANSMISSION ON SCALE-FREE NETWORKS
- Singular value inequality and graph energy change
- On the editing distance of graphs
- On a certain distance between isomorphism classes of graphs
- Distance in graphs
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- Median eigenvalues of bipartite subcubic graphs
- Unicyclic graphs with minimal energy
This page was built for publication: Graph distance measures based on topological indices revisited