On the distance based graph entropies

In this note we prove a sharp upper bound for the distance based graph entropy introduced in Chen et?al. (2014). Furthermore we resolve one part of the conjecture proposed in the same paper and provide counterexamples for the other part.

[1]  Wen-Yuan Qiu,et al.  A Survey on Mathematical Models for DNA Polyhedra , 2013 .

[2]  Xueliang Li,et al.  A Survey on the Randic Index , 2008 .

[3]  A. Mowshowitz,et al.  Entropy and the complexity of graphs. I. An index of the relative complexity of a graph. , 1968, The Bulletin of mathematical biophysics.

[4]  Kexiang Xu,et al.  A Survey on Graphs Extremal with Respect to Distance-Based Topological Indices , 2014 .

[5]  Aleksandar Ilic,et al.  Generalizations of Wiener Polarity Index and Terminal Wiener Index , 2011, Graphs Comb..

[6]  Nenad Trinajstić,et al.  Isomer discrimination by topological information approach , 1981 .

[7]  Matthias Dehmer,et al.  Information Theory of Networks , 2011, Symmetry.

[8]  Yongtang Shi,et al.  Interrelations of Graph Distance Measures Based on Topological Indices , 2014, PloS one.

[9]  Matthias Dehmer,et al.  A history of graph entropy measures , 2011, Inf. Sci..

[10]  Bohdan Zelinka,et al.  On a certain distance between isomorphism classes of graphs , 1975 .

[11]  Matthias Dehmer,et al.  Information Indices with High Discriminative Power for Graphs , 2012, PloS one.

[12]  Yongtang Shi,et al.  Extremality of degree-based graph entropies , 2014, Inf. Sci..

[13]  Bolian Liu,et al.  A Survey on Recent Results of Variable Wiener Index , 2013 .

[14]  Yongtang Shi,et al.  A Note on Distance-based Graph Entropies , 2014, Entropy.

[15]  Matthias Dehmer,et al.  On Extremal Properties of Graph Entropies , 2012 .

[16]  O. Bohigas,et al.  Spectral properties of distance matrices , 2003, nlin/0301044.