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

Autor:	Yu-Ming Chu, Hafiz Mutee ur Rehman, Jianfeng Yu, Tiejun Wu, Deeba Afzal
Rok vydání:	2020
Předmět:	Article Subject General Mathematics Graph entropy General Engineering Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Engineering (General). Civil engineering (General) Computer Science::Digital Libraries 01 natural sciences Graph Combinatorics 0103 physical sciences QA1-939 Computer Science::Mathematical Software 0202 electrical engineering electronic engineering information engineering Entropy (information theory) 020201 artificial intelligence & image processing TA1-2040 010306 general physics Mathematics MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj:	Mathematical Problems in Engineering, Vol 2020 (2020)
ISSN:	1563-5147 1024-123X
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bf8e72adf7d0cbd47944fa375fa4bea https://doi.org/10.1155/2020/5474501 Zobrazit plný text záznamu Plný text ve formátu PDF Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.