TY - JOUR
T1 - On the degeneracy of the Randić entropy and related graph measures
AU - Dehmer, Matthias
AU - Chen, Zengqiang
AU - Mowshowitz, Abbe
AU - Jodlbauer, Herbert
AU - Emmert-Streib, Frank
AU - Shi, Yongtang
AU - Tripathi, Shailesh
AU - Xia, Chengyi
N1 - Publisher Copyright:
© 2018 Elsevier Inc.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2019/10
Y1 - 2019/10
N2 - Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randić entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures’ applicability to deterministic and non-deterministic networks.
AB - Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randić entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures’ applicability to deterministic and non-deterministic networks.
KW - Data science
KW - Graphs
KW - Networks
KW - Quantitative graph theory
KW - Structural graph measures
KW - Structural network analysis
UR - http://www.scopus.com/inward/record.url?scp=85057760552&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2018.11.011
DO - 10.1016/j.ins.2018.11.011
M3 - Article
VL - 501
SP - 680
EP - 687
JO - Information Sciences
JF - Information Sciences
ER -