Entropy bounds for dendrimers
From MaRDI portal
Publication:279580
DOI10.1016/j.amc.2014.05.105zbMath1334.05137OpenAlexW1977996132MaRDI QIDQ279580
Yongtang Shi, Frank Emmert-Streib, Matthias Dehmer, Zeng-Qiang Chen
Publication date: 28 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.05.105
Related Items
On degree based topological indices of bridge graphs, Entropy of weighted graphs with Randić weights, Bounds for degree-based network entropies, Some algebraic polynomials and topological indices of generalized prism and toroidal polyhex networks, The augmented Zagreb indices of fluoranthene-type benzenoid systems, Wiener polarity index of dendrimers, The greatest values for atom-bond sum-connectivity index of graphs with given parameters, Spectral properties of inverse sum indeg index of graphs, The entropy of weighted graphs with atomic bond connectivity edge weights, Network entropies based on independent sets and matchings, On the general trigonometric sums weighted by character sums, On a problem analogues to Lehmer's and Hurwitz zeta-function, The general connectivity indices of fluoranthene-type benzenoid systems, On Zagreb indices, Zagreb polynomials of some nanostar dendrimers, Some bounds of weighted entropies with augmented Zagreb index edge weights, Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees, First degree-based entropy of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremality of degree-based graph entropies
- A history of graph entropy measures
- Structural information content of networks: graph entropy based on local vertex functionals
- Information processing in complex networks: Graph entropy and information functionals
- Inequalities for entropy-based measures of network information content
- Some bounds on entropy measures in information theory
- Entropy lower bounds for quantum decision tree complexity
- Information theoretic measures of UHG graphs with low computational complexity
- Advances in Network Complexity
- Information theoretical analysis of ecological networks
- On the measurable solution of a functional equation arising in information theory
- Elements of Information Theory
- 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: theory of majorization and its applications
