2015/05/18 by Xueliang Li, Li, Xueliang, Meiqin Wei +1
Computer Science · Mathematics · Physics and Astronomy · #05C90 #92C42 #92E10 #94A17 #Complex Network Analysis Techniques #Computational Drug Discovery Methods #FOS: Computer and information sciences #Graph theory and applications #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1505.04658
openalex publication_date 2015/05/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The entropy of a graph was first introduced by Rashevsky \citeRashevsky and Trucco \citeTrucco to interpret as the structural information content of the graph and serve as a complexity measure. In this paper, we first state a number of definitions of graph entropy measures and generalized graph entropies. Then we survey the known results about them from the following three respects: inequalities and extremal properties on graph entropies, relationships between graph structures, graph energies, topological indices and generalized graph entropies, complexity for calculation of graph entropies. Various applications of graph entropies together with some open problems and conjectures are also presented for further research.