Some bounds of weighted entropies with augmented Zagreb index edge weights
From MaRDI portal
Publication:2004176
DOI10.1155/2020/3562382zbMATH Open1459.05062OpenAlexW3049507462MaRDI QIDQ2004176
Yujie Huang, Hafiz Mutee-ur-Rehman, Xiaoli Qiang, Saima Nazeer, Deeba Afzal
Publication date: 14 October 2020
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/3562382
Applications of graph theory (05C90) Measures of information, entropy (94A17) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Information processing in complex networks: Graph entropy and information functionals
- Information theoretic measures of UHG graphs with low computational complexity
- Entropy bounds for dendrimers
- Extremality of degree-based graph entropies
- 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
- Inequalities for entropy-based measures of network information content
- Degree-based entropies of networks revisited
- Entropy of weighted graphs with RandiΔ weights
- An entropy-based uncertainty measurement approach in neighborhood systems
- Weighted entropy
- On the odd cycles of normal graphs
- Graphs that Split Entropies
- Two-step encoding for finite sources
- Entropy splitting for antiblocking corners and perfect graphs
- Source coding and graph entropies
- Perfect couples of graphs
- A note on distance-based graph entropies
- On the Augmented Zagreb Index
- Entropy and sorting.
- Grouping data by using the weighted entropy
- Edge version of metric dimension and doubly resolving sets of the necklace graph
- The entropy of weighted graphs with atomic bond connectivity edge weights
- Graph operations based on using distance-based graph entropies
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Basic inequalities for weighted entropies π π
- Szeged-like entropies of graphs π π
- The entropy of weighted graphs with atomic bond connectivity edge weights π π
- Bounds on augmented Zagreb index π π
- Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights π π
- Bounds for the augmented Zagreb index π π
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)