A Note on Distance-based Graph Entropies
A Note on Distance-based Graph Entropies
复制标题
关于基于距离的图熵的注释
DOI：
10.3390/e16105416
复制
发表时间：
2014-10-01
期刊：
影响因子：
2.7
通讯作者：
Shi, Yongtang
中科院分区：
文献类型：
--
作者：
Chen, Zengqiang;Dehmer, Matthias;Shi, Yongtang
A variety of problems in, e. g., discrete mathematics, computer science, information theory, statistics, chemistry, biology, etc., deal with inferring and characterizing relational structures by using graph measures. In this sense, it has been proven that information-theoretic quantities representing graph entropies possess useful properties such as a meaningful structural interpretation and uniqueness. As classical work, many distance-based graph entropies, e. g., the ones due to Bonchev et a l. and related quantities have been proposed and studied. Our contribution is to explore graph entropies that are based on a novel information functional, which is the number of vertices with distance k to a given vertex. In particular, we investigate some properties thereof leading to a better understanding of this new information-theoretic quantity.
