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

Matthias Dehmer, Zengqiang Chen, Abbe Mowshowitz, Herbert Jodlbauer, Frank Emmert-Streib, Yongtang Shi, Shailesh Tripathi, Chengyi Xia

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)680-687
Number of pages8
JournalInformation Sciences
Volume501
DOIs
Publication statusPublished - Oct 2019

Keywords

  • Data science
  • Graphs
  • Networks
  • Quantitative graph theory
  • Structural graph measures
  • Structural network analysis

Fingerprint Dive into the research topics of 'On the degeneracy of the Randić entropy and related graph measures'. Together they form a unique fingerprint.

Cite this