Some New Bounds of Weighted Graph Entropies with GA and Gaurava Indices Edge Weights

Abstract EN

Motivated by the concept of Shannon’s entropy, the degree-dependent weighted graph entropy was defined which is now become a tool for measurement of structural information of complex graph networks.

The aim of this paper is to study weighted graph entropy.

We used GA and Gaurava indices as edge weights to define weighted graph entropy and establish some bounds for different families of graphs.

Moreover, we compute the defined weighted entropies for molecular graphs of some dendrimer structures.