Entropy of weighted graphs with Randić weights

Abstract

Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs have been little investigated. Inspired by the work due to Eagle et al., we introduce the concept of graph entropy for special weighted graphs. Furthermore, we prove extremal properties by using elementary methods of classes of weighted graphs, and in particular, the one due to Bollobás and Erdös, which is also called the Randić weight. As a result, we derived statements on dendrimers that have been proven useful for applications. Finally, some open problems are presented.