Some bounds of weighted entropies with augmented Zagreb index edge weights
type: Item
instance of: scholarly article
title: Some bounds of weighted entropies with augmented Zagreb index edge weights
zbMATH Open document ID: 1459.05062
DOI: 10.1155/2020/3562382
author: Yujie Huang
author: Hafiz Mutee-ur-Rehman
author: Saima Nazeer
author: Deeba Afzal
author: Xiaoli Qiang
published in: Discrete Dynamics in Nature and Society
publication date: 2020-10-14T00:00:00Z
review text: Summary: The graph entropy was proposed by \textit{J. Körner} [in: Transactions of the 6th Prague conference on information theory, statistical decision functions, random processes, held at Prague, from September 19 to 25, 1971. Prague: Academia, Publishing House of the Czechoslovak Academy of Sciences. 411--425 (1973; Zbl 0298.94022)] when he was studying the problem of coding in information theory. The foundation of graph entropy is in information theory, but it was demonstrated to be firmly identified with some established and often examined graph-theoretic ideas. For instance, it gives an equal definition to a graph to be flawless, and it can likewise be connected to acquire lower bounds in graph covering problems. The objective of this study is to solve the open problem suggested by Kwun et al. in 2018. In this paper, we study the weighted graph entropy by taking augmented Zagreb edge weight and give bounds of it for regular, connected, bipartite, chemical, unicyclic, etc., graphs. Moreover, we compute the weighted graph entropy of certain nanotubes and plot our results to see dependence of weighted entropy on involved parameters.
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 94A17
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7260908
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/3562382
OpenAlex ID: W3049507462
cites work: Q5801644
cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
cites work: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
cites work: Entropy and the complexity of graphs: III. Graphs with prescribed information content
cites work: Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
cites work: Q5403959
cites work: An entropy-based uncertainty measurement approach in neighborhood systems
cites work: Q4053473
cites work: Graphs that Split Entropies
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: Entropy and sorting.
cites work: Entropy splitting for antiblocking corners and perfect graphs
cites work: Two-step encoding for finite sources
cites work: Perfect couples of graphs
cites work: Q4777339
cites work: On the odd cycles of normal graphs
cites work: Source coding and graph entropies
cites work: Information theoretic measures of UHG graphs with low computational complexity
cites work: Graph operations based on using distance-based graph entropies
cites work: Entropy bounds for dendrimers
cites work: Inequalities for entropy-based measures of network information content
cites work: Q2975304
cites work: Information processing in complex networks: Graph entropy and information functionals
cites work: A note on distance-based graph entropies
cites work: Q2975301
cites work: Q2975327
cites work: Extremality of degree-based graph entropies
cites work: Degree-based entropies of networks revisited
cites work: Q2975360
cites work: Q3369105
cites work: Entropy of weighted graphs with Randić weights
cites work: The entropy of weighted graphs with atomic bond connectivity edge weights
cites work: Edge version of metric dimension and doubly resolving sets of the necklace graph
cites work: On the Augmented Zagreb Index
cites work: Weighted entropy
cites work: Grouping data by using the weighted entropy
Recommended article: Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights
Recommended article: Q5280039
Recommended article: Q4995975
Recommended article: The entropy of weighted graphs with atomic bond connectivity edge weights
Recommended article: Q5165206
Recommended article: Bounds for the augmented Zagreb index
Recommended article: Szeged-like entropies of graphs
Recommended article: Bounds on augmented Zagreb index
Recommended article: Basic inequalities for weighted entropies
description: scientific article; zbMATH DE number 7260908