Counterexamples to conjectures on graph distance measures based on topological indexes

DOI10.1016/J.AMC.2016.10.024MaRDI QIDQ1734753zbMATH OpenOpenAlexWikidataFDO

Authors Aleksandar Ilić, Milovan Ilić

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

zbMATH Keywords

degree sequencedistance measureequienergetic treesgraph energyRandić indexWiener index

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: In this paper we disprove three conjectures from [M. Dehmer, F. Emmert-Streib, Y. Shi, Interrelations of graph distance measures based on topological indices, PLoS ONE 9 (2014) e94985] on graph distance measures based on topological indices by providing explicit classes of trees that do not satisfy proposed inequalities. The constructions are based on the families of trees that have the same Wiener index, graph energy or Randic index - but different degree sequences.

Recommendations

• On conjectures of network distance measures by using graph spectra
• Graph distance measures based on topological indices revisited
• On the two conjectures of the Wiener index
• Some new results on distance-based graph invariants
• Some extremal properties of the degree distance of a graph

Cites work

• A history of graph entropy measures
• A new method of measuring similarity for a special class of directed graphs
• Edge-vulnerability and mean distance
• Equienergetic and almost-equienergetic trees
• Extremality of degree-based graph entropies
• Fifty years of graph matching, network alignment and network comparison
• Generalizations of Wiener polarity index and terminal Wiener index
• Graph distance measures based on topological indices revisited
• Graph energy
• Graphs of extremal weights
• scientific article; zbMATH DE number 5259316 (Why is no real title available?)
• On the distance based graph entropies
• On the extremal values of general degree-based graph entropies
• On the Randić index of polymeric networks modelled by generalized Sierpiński graphs
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• Variation of the Wiener index under tree transformations
• Wiener index of trees: Theory and applications

Cited in

(3)

• On conjectures of network distance measures by using graph spectra
• On computing some degree based topological indices for backbone DNA networks
• Graph distance measures based on topological indices revisited

This page was built for publication: Counterexamples to conjectures on graph distance measures based on topological indexes

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