New inequalities between information measures of network information content (Q460228)

Summary: We refine a classical logarithmic inequality using a discrete case of Bernoulli inequality, and then we refine furthermore two information inequalities between information measures for graphs, based on information functionals, presented by \textit{M. Dehmer} and \textit{A. Mowshowitz} [Appl. Math. Comput. 215, No. 12, 4263--4271 (2010; Zbl 1220.05125)] as Theorems 4.7 and 4.8. The inequalities refer to entropy-based measures of network information content and have a great impact for information processing in complex networks (a subarea of research in modeling of complex systems).