Some bounds of weighted entropies with augmented Zagreb index edge weights
From MaRDI portal
Publication:2004176
Recommendations
- 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
Cites work
- 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?)
- 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
- 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 Size of Separating Systems and Families of Perfect Hash Functions
- On the Wiener index of trees with given number of branching vertices
- On the augmented Zagreb index
- On the odd cycles of normal graphs
- 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
Cited in
(3)
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)
