Some bounds of weighted entropies with augmented Zagreb index edge weights
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.
- Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights
- Entropy of weighted graphs with the degree-based topological indices as weights
- Bounds on augmented Zagreb index of graphs
- The entropy of weighted graphs with atomic bond connectivity edge weights
- Augmented Zagreb index: extremal results and bounds
- Bounds for the augmented Zagreb index
- Szeged-like entropies of graphs
- Bounds on augmented Zagreb index
- Basic inequalities for weighted entropies
- A note on distance-based graph entropies
- A survey on graphs extremal with respect to distance-based topological indices
- An entropy-based uncertainty measurement approach in neighborhood systems
- An exceptional property of first Zagreb index
- Degree-based entropies of networks revisited
- Edge version of metric dimension and doubly resolving sets of the necklace graph
- Entropy and sorting.
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Entropy bounds for dendrimers
- Entropy of weighted graphs with Randić weights
- Entropy splitting for antiblocking corners and perfect graphs
- Extremality of degree-based graph entropies
- Graph operations based on using distance-based graph entropies
- Graphs that Split Entropies
- Grouping data by using the weighted entropy
- scientific article; zbMATH DE number 6704594 (Why is no real title available?)
- scientific article; zbMATH DE number 3468645 (Why is no real title available?)
- scientific article; zbMATH DE number 3453665 (Why is no real title available?)
- scientific article; zbMATH DE number 6271723 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Inequalities for entropy-based measures of network information content
- Information processing in complex networks: Graph entropy and information functionals
- Information theoretic measures of UHG graphs with low computational complexity
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On the augmented Zagreb index
- On the odd cycles of normal graphs
- On the Size of Separating Systems and Families of Perfect Hash Functions
- On the Wiener index of trees with given number of branching vertices
- Perfect couples of graphs
- Source coding and graph entropies
- The entropy of weighted graphs with atomic bond connectivity edge weights
- Two-step encoding for finite sources
- Weighted entropy
This page was built for publication: Some bounds of weighted entropies with augmented Zagreb index edge weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004176)
