New upper bound and lower bound for degree-based network entropy (Q2412323)

Summary: The degree-based network entropy which is inspired by Shannon's entropy concept becomes the information-theoretic quantity for measuring the structural information of graphs and complex networks. In this paper, we study some properties of the degree-based network entropy. Firstly we develop a refinement of Jensen's inequality. Next we present the new and more accurate upper bound and lower bound for the degree-based network entropy only using the order, the size, the maximum degree and minimum degree of a network. The bounds have desirable performance to restrict the entropy in different kinds of graphs. Finally, we show an application to structural complexity analysis of a computer network modeled by a connected graph.