On the distance based graph entropies

作者：

Highlights：

•

摘要

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.

论文关键词：Shannon’s entropy,Graph entropy,Distance,Jensen’s inequality

论文评审过程：Received 21 March 2015, Revised 18 July 2015, Accepted 23 July 2015, Available online 2 September 2015, Version of Record 2 September 2015.

论文官网地址：https://doi.org/10.1016/j.amc.2015.07.100