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 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. [ABSTRACT FROM AUTHOR]