Counterexamples to conjectures on graph distance measures based on topological indexes
From MaRDI portal
Publication:1734753
DOI10.1016/j.amc.2016.10.024zbMath1411.05057arXiv1512.08149OpenAlexW2962833835WikidataQ123291065 ScholiaQ123291065MaRDI QIDQ1734753
Publication date: 27 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08149
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalizations of Wiener polarity index and terminal Wiener index
- Extremality of degree-based graph entropies
- A history of graph entropy measures
- On the distance based graph entropies
- Graph distance measures based on topological indices revisited
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
- Fifty years of graph matching, network alignment and network comparison
- On the extremal values of general degree-based graph entropies
- Variation of the Wiener index under tree transformations
- Graph Energy
- Edge-vulnerability and mean distance
- Wiener index of trees: Theory and applications
This page was built for publication: Counterexamples to conjectures on graph distance measures based on topological indexes