Tampere University of Technology

TUTCRIS Research Portal

Entropy bounds for dendrimers

Research output: Contribution to journalArticleScientificpeer-review


Original languageEnglish
Pages (from-to)462-472
Number of pages11
JournalApplied Mathematics and Computation
Publication statusPublished - 1 Sep 2014
Publication typeA1 Journal article-refereed


Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of complex networks. When considering Shannon entropy-based graph measures, there has been very little work to find their extremal values. A reason for this might be the fact that Shannon's entropy represents a multivariate function and all probability values are not equal to zero when considering graph entropies. Dehmer and Kraus proved some extremal results for graph entropies which are based on information functionals and express some conjectures generated by numerical simulations to find extremal values of graph entropies. Dehmer and Kraus discussed the extremal values of entropies for dendrimers. In this paper, we continue to study the extremal values of graph entropy for dendrimers, which has most interesting applications in molecular structure networks, and also in the pharmaceutical and biomedical area. Among all dendrimers with n vertices, we obtain the extremal values of graph entropy based on different well-known information functionals. Numerical experiments verifies our results.


  • Dendrimers, Extremal values, Graph entropy, Information theory, Shannon's entropy