Some New Properties for Degree-Based Graph Entropies

The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks. In this paper, we continue studying some new properties of the graph entropies based on information functionals involving vertex degrees. We prove the monotonicity of the graph entropies with respect to the power exponent. Considering only the maximum and minimum degrees of the ( n , m ) -graph, we obtain some upper and lower bounds for the degree-based graph entropy. These bounds have different performances to restrict the degree-based graph entropy in different kinds of graphs. Moreover the degree-based graph entropy can be estimated by these bounds