Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights

From MaRDI portal
Publication:2004228





Summary: 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.











This page was built for publication: Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004228)