Bounds for degree-based network entropies

In this paper, we continue studying degree-based entropies for networks. The quantities represent information-theoretic network measures which are based on using information functionals involving vertex degrees. We prove bounds for entropies which are based on information functionals using degree powers and come up with interrelations between different measures. Such interrelations are important to study connections between the measures required to understand the measures in depth.