| Summary: | A fullerene is a cubic three-connected graph whose faces are entirely composed of pentagons and hexagons. Entropy applied to graphs is one of the significant approaches to measuring the complexity of relational structures. Recently, the research on complex networks has received great attention, because many complex systems can be modelled as networks consisting of components as well as relations among these components. Information—theoretic measures have been used to analyze chemical structures possessing bond types and hetero-atoms. In the present article, we reviewed various entropy-based measures on fullerene graphs. In particular, we surveyed results on the topological information content of a graph, namely the orbit-entropy <i>I<sub>a</sub></i>(<i>G</i>), the symmetry index, a degree-based entropy measure <i>I<sub>λ</sub></i>(<i>G</i>), the eccentric-entropy <i>If<sub>σ</sub></i>(<i>G</i>) and the Hosoya entropy <i>H</i>(<i>G</i>).
|
|---|
