On the degeneracy of the Randić entropy and related graph measures

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...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2019-10, Vol.501, p.680-687
Main Authors: Dehmer, Matthias, Chen, Zengqiang, Mowshowitz, Abbe, Jodlbauer, Herbert, Emmert-Streib, Frank, Shi, Yongtang, Tripathi, Shailesh, Xia, Chengyi
Format: Article
Language:English
Subjects:
Data science
Graphs
Networks
Quantitative graph theory
Structural graph measures
Structural network analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2018.11.011