Abstract

Dendrimer molecules and aggregates are chemical structures with regular branching that underlies their physicochemical properties. Regular dendrimers have been studied both theoretically and experimentally, but the irregular intermediate structures between the dendrimers of neighboring generations have not. In the present work, dendrimer aggregates, both regular and intermediate, are investigated in terms of the information entropy approach. As found, the information entropy of the regular dendrimer asymptotically increases with the generation number; herewith, its maximal value equals 2. The intermediate structures have been studied for the growing dendrimer G1 → G2 → G3 → G4 with the tricoordinated building block. The plot of the information entropy of the growing dendrimer on the size has the frontier consisting of the lowest values that correspond to the regular and irregular structures described with the symmetrical graphs. Other intermediate structures have information entropies higher than the regular dendrimers. Thus, to move the system from one informationally stable state to another, its information capacity must be temporarily increased.

Highlights

  • Fractals are mathematical objects made up of patterns manifesting self-similarity [1]

  • The repeated nature comes from the chemical features of their building blocks, which associate in line with strict rules, viz., each block is coordinated with the constant number of other blocks, and this coordination number is reproduced at each step of aggregation

  • Branched colloid and surface aggregates or dendrimer molecules are typical examples of chemical fractals

Read more

Summary

Introduction

Fractals are mathematical objects made up of patterns manifesting self-similarity [1]. Ideal fractals exist only in the mind, but the concept provides useful approaches for describing real chemical objects with a highly branched structure. Chemical fractals and dendrimers have become the objects of theoretical research, including their treatment in terms of the graph and information theories [23,24,25,26,27,28,29]. Rationalizing their topology is based on the calculations of structural descriptors. In real cchheemmiiccaallssyysstteemmss,,bbooththfrfarcatcatlaal gaggrgergeagtaetseasnadndednednridmriemr emromleocluelceu, lbea, nbdan,dvna,luveasluarees anroet nlaortglearnguemnbuemrsbderusedtouethtoe sthteerisctehriincdhrianndcreasn[c1e4s–[2124]–. 22]

Information Entropy of Dendrimer
Results and Discussion
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call