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

Tiejun Wu, Hafiz Mutee Ur Rehman, Yu-Ming Chu, Deeba Afzal and Jianfeng Yu

Mathematical Problems in Engineering, 2020, vol. 2020, 1-9

Abstract:

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

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5474501.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5474501.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5474501

DOI: 10.1155/2020/5474501

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().