Novel inequalities for generalized graph entropies – Graph energies and topological indices

摘要

The entropy of a graph is an information-theoretic quantity for measuring the complexity of a graph. After Shannon introduced the entropy to information and communication, many generalizations of the entropy measure have been proposed, such as Rényi entropy and Daróczy entropy. In this article, we prove accurate connections (inequalities) between generalized graph entropies, graph energies, and topological indices. Additionally, we obtain some extremal properties of nine generalized graph entropies by employing graph energies and topological indices.